Extending partial representations of circle graphs

From MaRDI portal
Publication:5229540




Abstract: The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation calR giving some pre-drawn chords that represent an induced subgraph of G. The question is whether one can extend calR to a representation calR of the entire graph G, i.e., whether one can draw the remaining chords into a partially pre-drawn representation to obtain a representation of G. Our main result is an O(n3) time algorithm for partial representation extension of circle graphs, where n is the number of vertices. To show this, we describe the structure of all representations of a circle graph using split decomposition. This can be of independent interest.









This page was built for publication: Extending partial representations of circle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5229540)