Abstract
In this paper we show that the treewidth of a circle graph can be computed in polynomial time. A circle graph is a graph that is isomorphic to the intersection graph of a finite collection of chords of a circle. The TREEWIDTH problem can be viewed upon as the problem of finding a chordal embedding of the graph that minimizes the clique number. Our algorithm to determine the treewidth of a circle graph can be implemented to run in O(n3) time, where n is the number of vertices of the graph.
Cite
CITATION STYLE
Kloks, T. (1993). Treewidth of circle graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 108–117). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_240
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
