Extending Partial 1-Planar Drawings

by   Eduard Eiben, et al.

Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we are given a tuple (G,H,ℋ) consisting of a graph G, a connected subgraph H of G and a drawing ℋ of H, and the task is to extend ℋ into a drawing of G while maintaining some desired property of the drawing, such as planarity. In this paper we study the problem of extending partial 1-planar drawings, which are drawings in the plane that allow each edge to have at most one crossing. In addition we consider the subclass of IC-planar drawings, which are 1-planar drawings with independent crossings. Recognizing 1-planar graphs as well as IC-planar graphs is -complete and the -completeness easily carries over to the extension problem. Therefore, our focus lies on establishing the tractability of such extension problems in a weaker sense than polynomial-time tractability. Here, we show that both problems are fixed-parameter tractable when parameterized by the number of edges missing from H, i.e., the edge deletion distance between H and G. The second part of the paper then turns to a more powerful parameterization which is based on measuring the vertex+edge deletion distance between the partial and complete drawing, i.e., the minimum number of vertices and edges that need to be deleted to obtain H from G.


page 1

page 2

page 3

page 4


Extending Nearly Complete 1-Planar Drawings in Polynomial Time

The problem of extending partial geometric graph representations such as...

Extending Upward Planar Graph Drawings

In this paper we study the computational complexity of the Upward Planar...

Extending Orthogonal Planar Graph Drawings is Fixed-Parameter Tractable

The task of finding an extension to a given partial drawing of a graph w...

Z_2-genus of graphs and minimum rank of partial symmetric matrices

The genus g(G) of a graph G is the minimum g such that G has an embeddin...

Crossing-Optimal Extension of Simple Drawings

In extension problems of partial graph drawings one is given an incomple...

On The Sitting Closer to Friends than Enemies Problem in Trees and An Intersection Model for Strongly Chordal Graphs

A signed graph is a graph with a sign assignment to its edges. The Sitti...

Polyline Drawings with Topological Constraints

Let G be a simple topological graph and let Γ be a polyline drawing of G...

Please sign up or login with your details

Forgot password? Click here to reset