Homology flows, cohomology cuts

DOI10.1145/1536414.1536453zbMath1304.05065OpenAlexW2101952975MaRDI QIDQ5172721

Amir Nayyeri, Jeff Erickson, Erin Wolf Chambers

Publication date: 4 February 2015

Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationcomputational topology

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (3)

Hardness results for homology localization ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Unnamed Item

This page was built for publication: Homology flows, cohomology cuts