Counting and sampling minimum cuts in genus g graphs

DOI10.1145/2462356.2462366zbMath1305.05217OpenAlexW2097053246MaRDI QIDQ5174485

Amir Nayyeri, Kyle Fox, Erin Wolf Chambers

Publication date: 17 February 2015

Published in: Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2462356.2462366

zbMATH Keywords

computational topologytopological graph theoryminimum cuts

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts ⋮ Integrating and Sampling Cuts in Bounded Treewidth Graphs

This page was built for publication: Counting and sampling minimum cuts in genus g graphs