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

@article{Bienstock1990OnTC,
  title={On the complexity of embedding planar graphs to minimize certain distance measures},
  author={Daniel Bienstock and Clyde L. Monma},
  journal={Algorithmica},
  year={1990},
  volume={5},
  pages={93-109}
}
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. 

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 34 CITATIONS

Finding a Minimum-depth Embedding of a Planar Graph in O(n4) Time

VIEW 10 EXCERPTS
CITES METHODS, RESULTS & BACKGROUND
HIGHLY INFLUENCED

Computing Radial Drawings on the Minimum Number of Circles

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Homotopy height, grid-major height and graph-drawing height

Therese Biedl, Erin W. Chambers, David Eppstein, Arnaud De Mesmay, Tim Ophelders
  • ArXiv
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

Circular Separation Dimension of a Subclass of Planar Graphs

  • Discrete Mathematics & Theoretical Computer Science
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Inserting Multiple Edges into a Planar Graph

Markus Chimani, Petr Hliněný
  • Symposium on Computational Geometry
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

Testing Mutual duality of Planar graphs

  • Int. J. Comput. Geometry Appl.
  • 2013
VIEW 2 EXCERPTS
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-5 OF 5 REFERENCES

Approximation algorithms for NP - complete problems in planar graphs , Proc . 24 th IEEE Syrup

M. Klawe, D. Lichtenstein, N. Linial, A. Wigderson
  • 1985

Multi-layer grid embeddings

  • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985

On the complexity of covering vertices by faces in a planar graph

C. L. Monma
  • S l A M J . Comput .
  • 1983