Contact Representations of Planar Graphs: Extending a Partial Representation is Hard

• Published in: Graph-Theoretic Concepts in Computer Science Vol. 8747; pp. 139 - 151
• Main Authors: Chaplick, Steven, Dorbec, Paul, Kratochvíl, Jan, Montassier, Mickael, Stacho, Juraj
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 01.01.2014; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Algorithms & data structures; Circle Graphs; Contact Grid; Discrete mathematics; Geometric Intersection Graphs; Geometry; Permutation Graphs; Planar Bipartite Graphs
• ISBN: 3319123394; 9783319123394
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-12340-0_12

Planar graphs are known to have geometric representations of various types, e.g. as contacts of disks, triangles or - in the bipartite case - vertical and horizontal segments. It is known that such representations can be drawn in linear time, we here wonder whether it is as easy to decide whether a partial representation can be completed to a representation of the whole graph. We show that in each of the cases above, this problem becomes NP-hard. These are the first classes of geometric graphs where extending partial representations is provably harder than recognition, as opposed to e.g. interval graphs, circle graphs, permutation graphs or even standard representations of plane graphs. On the positive side we give two polynomial time algorithms for the grid contact case. The first one is for the case when all vertical segments are pre-represented (note: the problem remains NP-complete when a subset of the vertical segments is specified, even if none of the horizontals are). Secondly, we show that the case when the vertical segments have only their \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x$$\end{document}-coordinates specified (i.e., they are ordered horizontally) is polynomially equivalent to level planarity, which is known to be solvable in polynomial time.