• DocumentCode
    2181784
  • Title

    Partition of planar flow networks

  • Author

    Johnson, Donald B. ; Venkatesan, Shankar M.

  • fYear
    1983
  • fDate
    7-9 Nov. 1983
  • Firstpage
    259
  • Lastpage
    264
  • Abstract
    We give a new characterization of the planar separator theorem in terms of mutually non-containing closed Jordan Curves. using this, we develop an O(n √n logn) maximum flow algorithm for directed planar networks (hence for any planar network).
  • Keywords
    Computer science; Particle separators; Partitioning algorithms; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1983., 24th Annual Symposium on
  • Conference_Location
    Tucson, AZ, USA
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0508-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1983.44
  • Filename
    4568086
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2181784