A simpler linear-time recognition of circular-arc graphs

Haim Kaplan, Yahav Nussbaum

Research output: Contribution to journalArticlepeer-review

Abstract

We give a linear-time recognition algorithm for circular-arc graphs based on the algorithm of Eschen and Spinrad (Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 128-137, 1993) and Eschen (PhD thesis, 1997). Our algorithm both improves the time bound of Eschen and Spinrad, and fixes some flaws in it. Our algorithm is simpler than the earlier linear-time recognition algorithm of McConnell (Algorithmica 37(2):93-147, 2003), which is the only linear time recognition algorithm previously known.

Original languageEnglish
Pages (from-to)694-737
Number of pages44
JournalAlgorithmica
Volume61
Issue number3
DOIs
StatePublished - Nov 2011

Keywords

  • Circular-arc graph
  • Circular-arc model
  • Consecutive-ones property
  • Intersection graph
  • Recognition algorithm

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Applied Mathematics
  • Computer Science Applications

Fingerprint

Dive into the research topics of 'A simpler linear-time recognition of circular-arc graphs'. Together they form a unique fingerprint.

Cite this