Research output per year
Research output per year
Steven Chaplick, Radoslav Fulek, Pavel Klavík^{*}
Research output: Contribution to journal › Article › Academic › peer-review
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 ' giving some predrawn chords that represent an induced subgraph of G. The question is whether one can extend ' to a representation of the entire graph G, that is, whether one can draw the remaining chords into a partially predrawn representation to obtain a representation of G. Our main result is an ( 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.
Original language | English |
---|---|
Pages (from-to) | 365-394 |
Number of pages | 30 |
Journal | Journal of Graph Theory |
Volume | 91 |
Issue number | 4 |
DOIs | |
Publication status | Published - Aug 2019 |
Externally published | Yes |
Research output: Working paper / Preprint › Preprint
Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceeding › Academic › peer-review