Haim Kaplan, Yahav Nussbaum. A Simpler Linear-Time Recognition of Circular-Arc Graphs. In Lars Arge, Rusins Freivalds, editors, Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings. Volume 4059 of Lecture Notes in Computer Science, pages 41-52, Springer, 2006. [doi]
@inproceedings{KaplanN06,
title = {A Simpler Linear-Time Recognition of Circular-Arc Graphs},
author = {Haim Kaplan and Yahav Nussbaum},
year = {2006},
doi = {10.1007/11785293_7},
url = {http://dx.doi.org/10.1007/11785293_7},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/KaplanN06},
cites = {0},
citedby = {0},
pages = {41-52},
booktitle = {Algorithm Theory - SWAT 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings},
editor = {Lars Arge and Rusins Freivalds},
volume = {4059},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-35753-X},
}