Homology Flows, Cohomology Cuts
From MaRDI portal
Publication:4910577
DOI10.1137/090766863zbMath1260.05070OpenAlexW2060075372MaRDI QIDQ4910577
Amir Nayyeri, Jeff Erickson, Erin Wolf Chambers
Publication date: 19 March 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/090766863
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)
Related Items (8)
Minimum Cuts in Surface Graphs ⋮ Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs ⋮ Multicuts in planar and bounded-genus graphs with bounded number of terminals ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals ⋮ Computational topology and the Unique Games Conjecture ⋮ Discrete systolic inequalities and decompositions of triangulated surfaces
This page was built for publication: Homology Flows, Cohomology Cuts
