A simpler linear-time recognition of circular-arc graphs

Haim Kaplan; Yahav Nussbaum

doi:10.1007/s00453-010-9432-y

A simpler linear-time recognition of circular-arc graphs

Haim Kaplan, Yahav Nussbaum^*

^*Corresponding author for this work

School of Computer Science

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	694-737
Number of pages	44
Journal	Algorithmica
Volume	61
Issue number	3
DOIs	https://doi.org/10.1007/s00453-010-9432-y
State	Published - Nov 2011

Keywords

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

Access to Document

10.1007/s00453-010-9432-y

Cite this

@article{64855b3646e24a80b2a238cbccc6c9e5,

title = "A simpler linear-time recognition of circular-arc graphs",

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.",

keywords = "Circular-arc graph, Circular-arc model, Consecutive-ones property, Intersection graph, Recognition algorithm",

author = "Haim Kaplan and Yahav Nussbaum",

year = "2011",

month = nov,

doi = "10.1007/s00453-010-9432-y",

language = "אנגלית",

volume = "61",

pages = "694--737",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - A simpler linear-time recognition of circular-arc graphs

AU - Kaplan, Haim

AU - Nussbaum, Yahav

PY - 2011/11

Y1 - 2011/11

N2 - 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.

AB - 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.

KW - Circular-arc graph

KW - Circular-arc model

KW - Consecutive-ones property

KW - Intersection graph

KW - Recognition algorithm

UR - http://www.scopus.com/inward/record.url?scp=80052822881&partnerID=8YFLogxK

U2 - 10.1007/s00453-010-9432-y

DO - 10.1007/s00453-010-9432-y

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:80052822881

SN - 0178-4617

VL - 61

SP - 694

EP - 737

JO - Algorithmica

JF - Algorithmica

IS - 3

ER -

A simpler linear-time recognition of circular-arc graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this