Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
From MaRDI portal
Publication:3092225
DOI10.1007/978-3-642-23719-5_14zbMath1346.05286OpenAlexW2106352538MaRDI QIDQ3092225
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_14
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (15)
Minimum Cuts in Surface Graphs ⋮ Map graphs having witnesses of large girth ⋮ On the negative cost girth problem in planar networks ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Algorithms solving the matching cut problem ⋮ Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs ⋮ Unnamed Item ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Short and Simple Cycle Separators in Planar Graphs
This page was built for publication: Min-Cuts and Shortest Cycles in Planar Graphs in O(n loglogn) Time
