Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

Haim Kaplan, Yahav Nussbaum

Research output: Contribution to journalArticlepeer-review

Abstract

We give two new linear-time algorithms, one for recognizing proper circular-arc graphs and the other for recognizing unit circular-arc graphs. Both algorithms provide either 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. No other previous algorithm for each of these two graph classes provides a certificate for its result.

Original languageEnglish
Pages (from-to)3216-3230
Number of pages15
JournalDiscrete Applied Mathematics
Volume157
Issue number15
DOIs
StatePublished - 6 Aug 2009

Keywords

  • Certifying algorithm
  • Graph recognition
  • Proper circular-arc
  • Unit circular-arc

Fingerprint

Dive into the research topics of 'Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs'. Together they form a unique fingerprint.

Cite this