Abstract
We give a linear time recognition algorithm for circular-arc graphs. Our algorithm is much simpler than the linear time recognition algorithm of McConnell [10] (which is the only linear time recognition algorithm previously known). Our algorithm is a new and careful implementation of the algorithm of Eschen and Spinrad [4, 5]. We also tighten the analysis of Eschen and Spinrad. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Kaplan, H., & Nussbaum, Y. (2006). A simpler linear-time recognition of circular-arc graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4059 LNCS, pp. 41–52). Springer Verlag. https://doi.org/10.1007/11785293_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
