scientific article; zbMATH DE number 6469225
From MaRDI portal
Publication:5501344
zbMath1318.05073MaRDI QIDQ5501344
Parinya Chalermsook, Danupon Nanongkai, Jittat Fakcharoenphol
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Minimum Cuts in Surface Graphs ⋮ On the negative cost girth problem in planar networks ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Exploiting planarity in separation routines for the symmetric traveling salesman problem ⋮ Planar graphs, negative weight edges, shortest paths, and near linear time ⋮ Unnamed Item ⋮ A fast algorithm for minimum weight odd circuits and cuts in planar graphs
