Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums

Authors:
Amit Chakrabarti;Alexander Jaffe;James R. Lee;Justin Vincent
Affiliations:
-;-;-;-
Venue:
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Year:
2008

Citing 0
Cited 8

On the geometry of graphs with a forbidden minor

Proceedings of the forty-first annual ACM symposium on Theory of computing
Approximating sparsest cut in graphs of bounded treewidth

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Bandwidth and low dimensional embedding

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Sparsest cut on bounded treewidth graphs: algorithms and hardness results

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the 2-sum embedding conjecture

Proceedings of the twenty-ninth annual symposium on Computational geometry
Bandwidth and low dimensional embedding

Theoretical Computer Science
Pathwidth, trees, and random embeddings

Combinatorica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the properties of embeddings, multicommodity flows, and sparse cuts inminor-closed familiesof graphs which are also closed under 2-sums; this includes planar graphs,graphs of bounded treewidth, and constructions based on recursive edge replacement.