scientific article; zbMATH DE number 6297748
From MaRDI portal
Publication:5417668
zbMath1288.05055MaRDI QIDQ5417668
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items (13)
Minimum Cuts in Surface Graphs ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ Maximum flows in parametric graph templates ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ On the complexity of time-dependent shortest paths ⋮ A stronger lower bound on parametric minimum spanning trees ⋮ A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ Notes on graph product structure theory ⋮ An approximation algorithm for a general class of multi-parametric optimization problems ⋮ Planar Digraphs
This page was built for publication:
