Cuts, Trees and ℓ1-Embeddings of Graphs*

2004/04/01 by Anupam Gupta†, Ilan Newman, Yuri Rabinovich +2 · 3 citations
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Cooperative Communication and Network Coding

paper · doi:10.1007/s00493-004-0015-x

crossref issued 2004/04/01 · crossref published 2004/04/01 · crossref published-print 2004/04/01 · openalex publication_date 2004/04/01 · crossref created 2004/05/26 · crossref deposited 2019/05/28 · openalex created_date 2025/10/10 · crossref indexed 2026/06/30 · openalex updated_date 2026/07/15

Citations

• Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs

Cited by

• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• List of unsolved problems in mathematics [wikipedia]