Arboricity and subgraph listing algorithms
SIAM Journal on Computing
The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Journal of Algorithms
Information Processing Letters
Simultaneous embedding of planar graphs with few bends
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
The simultaneous embedding problem is, given two planar graphs G1=(V,E1) and G2=(V,E2), to find planar embeddings ϕ(G1) and ϕ(G2) such that each vertex v∈V is mapped to the same point in ϕ(G1) and in ϕ(G2). This article presents a linear-time algorithm for the simultaneous embedding problem such that edges are drawn as polygonal chains with at most two bends and all vertices and all bends of the edges are placed on a grid of polynomial size. An extension of this problem with so-called fixed edges is also considered A further linear-time algorithm of this article solves the following problem: Given a planar graph G and a set of distinct points, find a planar embedding for G that maps each vertex to one of the given points. The solution presented also uses at most two bends per edge and a grid whose size is polynomial in the size of the grid that includes all given points. An example shows two bends per edge to be optimal