Title :
Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums
Author :
Chakrabarti, Amit ; Jaffe, Ariel ; Lee, J. ; Vincent, Julien
Author_Institution :
Dept. of Comput. Sci., Dartmouth Coll., Hanover, NH
Abstract :
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, graphs of bounded treewidth, and constructions based on recursive edge replacement.
Keywords :
computational complexity; trees (mathematics); bounded treewidth graph; computational complexity; linearization method; lossy invariant; minor free graph; multicommodity flow; planar graph; recursive edge replacement; sparse graph cut; topological graph embedding; Books; Computer science; Graph theory; Mathematics; Topology; Tree graphs; Upper bound;
Conference_Titel :
Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
Conference_Location :
Philadelphia, PA
Print_ISBN :
978-0-7695-3436-7
DOI :
10.1109/FOCS.2008.79
