• DocumentCode
    1595863
  • 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
  • fYear
    2008
  • Firstpage
    761
  • Lastpage
    770
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2008. FOCS '08. IEEE 49th Annual IEEE Symposium on
  • Conference_Location
    Philadelphia, PA
  • ISSN
    0272-5428
  • Print_ISBN
    978-0-7695-3436-7
  • Type

    conf

  • DOI
    10.1109/FOCS.2008.79
  • Filename
    4691008
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1595863