Extending Partial Representations of Subclasses of Chordal Graphs
Chordal graphs are intersection graphs of subtrees in a tree. We investigate complexity of the partial representation extension problem for chordal graphs. A partial representation specifies a tree T′ and some pre-drawn subtrees. It asks whether it is possible to construct a representation inside a modified tree T which extends the partial representation (keeps the pre-drawn subtrees unchanged).
We consider four modifications of T′ and get vastly different problems. In some cases, the problem is interesting even if just T′ is given and no subtree is pre-drawn. Also, we consider three well-known subclasses of chordal graphs: Proper interval graphs, interval graphs and path graphs. We give an almost complete complexity characterization.
In addition, we study parametrized complexity by the number of pre-drawn subtrees, the number of components and the size of the tree T′. We describe an interesting relation with integer partition problems. The problem 3-Partition is used in the NP-completeness reductions. The BinPacking problem is closely related to the extension of interval graphs when space in T′ is limited, and we obtain “equivalency” with BinPacking.
Unable to display preview. Download preview PDF.
- 1.Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. CoRR abs/1112.0245 (2011)Google Scholar
- 8.Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. North-Holland Publishing Co. (2004)Google Scholar
- 11.Klavík, P., Kratochvíl, J., Otachi, Y., Ignaz, R., Saitoh, T., Saumell, M., Vyskočil, T.: Extending partial representations of proper and unit interval graphs (in preparation, 2012)Google Scholar