Extending Partial Representations of Function Graphs and Permutation Graphs
Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time. Function graphs generalize permutation graphs, which arise when all functions considered are linear.
We focus on the problem of extending partial representations, which generalizes the recognition problem. We observe that for permutation graphs an easy extension of Golumbic’s comparability graph recognition algorithm can be exploited. This approach fails for function graphs. Nevertheless, we present a polynomial-time algorithm for extending a partial representation of a graph by functions defined on the entire interval [0,1] provided for some of the vertices. On the other hand, we show that if a partial representation consists of functions defined on subintervals of [0,1], then the problem of extending this representation to functions on the entire interval [0,1] becomes NP-complete.
Unable to display preview. Download preview PDF.
- 1.Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. In: SODA 2010, pp. 202–221 (2010)Google Scholar
- 4.Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems (2011), http://arxiv.org/abs/1112.0245
- 9.Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press (1980)Google Scholar
- 16.Kuratowski, K.: Sur le problème des courbes gauches en topologie. Fund. Math. 15, 217–283 (1930)Google Scholar
- 20.Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. In: STOC 2002, pp. 1–6 (2002)Google Scholar
- 21.Spinrad, J.P.: Efficient Graph Representations. Field Institute Monographs (2003)Google Scholar