Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Embeddings of topological graphs: Lossy invariants, linearization, and 2-sums
 

Summary: Embeddings of topological graphs:
Lossy invariants, linearization, and 2-sums
Amit Chakrabarti
Alexander Jaffe
James R. Lee
Justin Vincent
Abstract
We study the properties of embeddings, multicom-
modity flows, and sparse cuts in minor-closed families
of graphs which are also closed under 2-sums; this in-
cludes planar graphs, graphs of bounded treewidth, and
constructions based on recursive edge replacement. In
particular, we show the following.
Every graph which excludes K4 as a minor (in par-
ticular, series-parallel graphs) admits an embed-
ding into L1 with distortion at most 2, confirming
a conjecture of Gupta, Newman, Rabinovich, and
Sinclair, and improving over their upper bound of
14. This shows that in every multi-commodity flow
instance on such a graph, one can route a maximum

  

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

 

Collections: Computer Technologies and Information Sciences