Computing a Minimum-Depth Planar Graph Embedding in O ( n 4) Time
نویسندگان
چکیده
Consider an n-vertex planar graph G. We present an O(n)-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 distance embedding.
منابع مشابه
Minimum Depth Graph Embedding
The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has important practical applications to graph drawing. We give a linear time algorithm for computing a minimum depth embedding of a planar graphs whose biconnected components have a prescribed embedding.
متن کاملMinimum s-t cut in undirected planar graphs when the source and the sink are close
Consider the minimum s − t cut problem in an embedded undirected planar graph. Let p be the minimum number of faces that a curve from s to t passes through. If p = 1, that is, the vertices s and t are on the boundary of the same face, then the minimum cut can be found in O(n) time. For general planar graphs this cut can be found in O(n log n) time. We unify these results and give an O(n log p) ...
متن کاملImproved Minimum Cuts and Maximum Flows in Undirected Planar Graphs
In this paper we study minimum cut and maximum flow problems on planar graphs, both in static and in dynamic settings. First, we present an algorithm that given an undirected planar graph computes the minimum cut between any two given vertices in O(n log logn) time. Second, we show how to achieve the same O(n log logn) bound for the problem of computing maximum flows in undirected planar graphs...
متن کاملI/O-Efficient Algorithms for Planar Graphs I: Separators∗
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O (N/√r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O (√r) can be computed in O(sort(N)) I/Os, provided that M ≥ 56r log B. Together with the planar em...
متن کاملMinimum Length Embedding of Planar Graphs at Fixed Vertex Locations
We consider the problem of finding a planar embedding of a graph at fixed vertex locations that minimizes the total edge length. The problem is known to be NP-hard. We give polynomial time algorithms achieving an O( √ n logn) approximation for paths and matchings, and an O(n) approximation for general graphs.
متن کامل