Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs

Haim Kaplan, Yahav Nussbaum

Abstract: We give two new algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. The algorithms either provide 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.