Abstract
We are given a circular-arc graph, represented by a circular-arc model; our goal is to decide whether the graph is a proper circular-arc graph. We do so in time linear in the number of vertices of the graph, regardless of the number of edges which may be quadratic in the number of vertices. For every input graph, we either provide a proper circular-arc model for the graph, or a forbidden subgraph induced in the graph. © 2008 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Nussbaum, Y. (2008). From a circular-arc model to a proper circular-arc model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5344 LNCS, pp. 324–335). https://doi.org/10.1007/978-3-540-92248-3_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
