论文信息 - On the complexity of embedding planar graphs to minimize certain distance measures

On the complexity of embedding planar graphs to minimize certain distance measures

We present polynomial-time algorithms for computing an embedding of a planar graph that minimizes the outerplanarity, or the width, or the radius, or some other measures of distance to the outer face. On the other hand, we show it is NP-hard to compute an embedding that minimizes the diameter of the dual graph.

Clyde L. Monma | Daniel Bienstock

[1] Brenda S. Baker. Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version) , 1983, FOCS.

[2] L. Lovász. Combinatorial problems and exercises , 1979 .

[3] Robert E. Tarjan,et al. Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[4] Alok Aggarwal,et al. Multi-layer grid embeddings , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5] B. A. Gregory,et al. Problems and Exercises , 1981 .

[6] Clyde L. Monma,et al. On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[7] D. Dolev,et al. Planar Embedding of Planar Graphs , 1983 .

[8] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[9] Clyde L. Monma,et al. Optimal enclosing regions in planar graphs , 1989, Networks.