On the 2-sum embedding conjecture

DOI10.1145/2462356.2492436zbMath1305.05153OpenAlexW2036123557MaRDI QIDQ5174478

Daniel E. Poore, James R. Lee

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.2492436

zbMATH Keywords

sparsest cutmetric embeddingsmax-flow min-cut gaps

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 (1)

A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces

This page was built for publication: On the 2-sum embedding conjecture