@inproceedings{c54e0ee26f094feebf76bb7a584b7bdd,

title = "Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs",

abstract = "We give two new algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.",

author = "Haim Kaplan and Yahav Nussbaum",

note = "Funding Information: Research was partially supported by the United States–Israel Binational Science Foundation, grant number 2006204. ; 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006 ; Conference date: 22-06-2006 Through 24-06-2006",

year = "2006",

doi = "10.1007/11917496_26",

language = "אנגלית",

isbn = "3540483810",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "289--300",

booktitle = "Graph-Theoretic Concepts in Computer Science - 32nd International Workshop, WG 2006, Revised Papers",

}