Holiest minimum-cost paths and flows in surface graphs

DOI10.1145/3188745.3188904MaRDI QIDQ5230385zbMATH OpenOpenAlexFDO

Authors Jeff Erickson, Kyle Fox, Luvsandondov Lkhamsuren

Publication date 22 August 2019

Published in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1804.01045

zbMATH Keywords

computational topologygraphsnetwork flowsshortest pathssurfaces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Paths and cycles (05C38) Computational methods for problems pertaining to algebraic topology (55-08) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: Let $G$ be an edge-weighted directed graph with $n$ vertices embedded on an orientable surface of genus $g$. We describe a simple deterministic lexicographic perturbation scheme that guarantees uniqueness of minimum-cost flows and shortest paths in $G$. The perturbations take $O(gn)$ time to compute. We use our perturbation scheme in a black box manner to derive a deterministic $O(nloglogn)$ time algorithm for minimum cut in emph{directed} edge-weighted planar graphs and a deterministic $O(g^{2}nlogn)$ time proprocessing scheme for the multiple-source shortest paths problem of computing a shortest path oracle for all vertices lying on a common face of a surface embedded graph. The latter result yields faster deterministic near-linear time algorithms for a variety of problems in constant genus surface embedded graphs. Finally, we open the black box in order to generalize a recent linear-time algorithm for multiple-source shortest paths in unweighted undirected planar graphs to work in arbitrary orientable surfaces. Our algorithm runs in $O(g^{2}nlogg)$ time in this setting, and it can be used to give improved linear time algorithms for several problems in unweighted undirected surface embedded graphs of constant genus including the computation of minimum cuts, shortest topologically non-trivial cycles, and minimum homology bases.

Recommendations

• Minimum Cuts in Surface Graphs
• scientific article; zbMATH DE number 6297748
• Min-Cost Flow in Unit-Capacity Planar Graphs
• Finding shortest non-trivial cycles in directed graphs on surfaces
• Finding shortest non-trivial cycles in directed graphs on surfaces
• Minimum flows in (s,t) planar networks
• Shortest path embeddings of graphs on surfaces
• Shortest path embeddings of graphs on surfaces
• Minimum cost flows in graphs with unit capacities
• Shortest Path Problems on a Polyhedral Surface

Cited in

(13)

• Single-source shortest paths and strong connectivity in dynamic planar graphs
• Topologically trivial closed walks in directed surface graphs
• Multiple-source shortest paths in embedded graphs
• Approximation algorithms for Euler genus and related problems
• Topologically trivial closed walks in directed surface graphs
• Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
• Minimum Cuts in Surface Graphs
• Fully dynamic strongly connected components in planar digraphs
• Computing shortest closed curves on non-orientable surfaces
• Polynomial-time approximation schemes for facility location on planar graphs
• Almost optimal exact distance oracles for planar graphs
• Faster construction of a planar distance oracle with \(\tilde{O}(1)\) query time

This page was built for publication: Holiest minimum-cost paths and flows in surface graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230385)