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 and a partial representation giving some pre-drawn chords that represent an induced subgraph of . The question is whether one can extend to a representation of the entire graph , i.e., whether one can draw the remaining chords into a partially pre-drawn representation to obtain a representation of . Our main result is an time algorithm for partial representation extension of circle graphs, where 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.
Recommendations
Cited in
(12)- Partial and simultaneous transitive orientations via modular decompositions
- Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
- Extending partial representations of trapezoid graphs
- Extending partial representations of circle graphs in near-linear time
- Extending partial representations of subclasses of chordal graphs
- Extending partial orthogonal drawings
- Extending partial representations of rectangular duals with given contact orientations
- Inserting one edge into a simple drawing is hard
- Extending Partial Orthogonal Drawings
- Extending partial representations of circular-arc graphs
- Extending Partial Representations of Subclasses of Chordal Graphs
- Extending partial representations of circle graphs
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)