• DocumentCode
    3326151
  • Title

    Flows in undirected unit capacity networks

  • Author

    Goldberg, Andrew V. ; Rao, Satish

  • Author_Institution
    NEC Res. Inst., Princeton, NJ, USA
  • fYear
    1997
  • fDate
    20-22 Oct 1997
  • Firstpage
    32
  • Lastpage
    34
  • Abstract
    We describe an O(min(m, n3/2)m1/2)-time algorithm for finding maximum flows in undirected networks with unit capacities and no parallel edges. This improves upon the previous bound of Karzanov and Even and Tarjan when m=ω(n3/2), and upon a randomized bound of Karger when υ=Ω(n7/4/m 1/2)
  • Keywords
    computational complexity; graph theory; computation time; maximum flows; undirected networks; undirected unit capacity networks; IEL; Intelligent networks; National electric code; Partitioning algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on
  • Conference_Location
    Miami Beach, FL
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-8197-7
  • Type

    conf

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