Computing a minimum-depth planar graph embedding in O(n4) time

Authors:
Patrizio Angelini;Giuseppe Di Battista;Maurizio Patrignani
Affiliations:
Dipartimento di Informatica e Automazione, Università di Roma Tre;Dipartimento di Informatica e Automazione, Università di Roma Tre;Dipartimento di Informatica e Automazione, Università di Roma Tre
Venue:
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Year:
2007

Citing 6
Cited 1

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

SIAM Journal on Computing
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
On-Line Planarity Testing

SIAM Journal on Computing
Minimum Depth Graph Embedding

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Minimum depth graph embeddings and quality of the drawings: an experimental analysis

GD'05 Proceedings of the 13th international conference on Graph Drawing
Computing radial drawings on the minimum number of circles

GD'04 Proceedings of the 12th international conference on Graph Drawing

Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures

ACM Transactions on Embedded Computing Systems (TECS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consider an n-vertex planar graph G. We present an O(n4)- time algorithm for computing an embedding of G with minimum distance from the external face. This bound improves on the best previous bound by an O(n log n) factor. As a side effect, our algorithm improves the bounds of several algorithms that require the computation of a minimum depth embedding.