• DocumentCode
    3170288
  • Title

    Efficient Implementation Of Graph Algorithms Using Contraction

  • Author

    Gabow, Harold N. ; Galil, Zvi ; Spencer, Thomas H.

  • Author_Institution
    University of Colorado at Boulder
  • fYear
    1984
  • fDate
    24-26 Oct. 1984
  • Firstpage
    347
  • Lastpage
    357
  • Abstract
    We define a graph problem which we refer to as the component merging problem. Versions of the problem appear as bottlenecks in various graph algorithms. We show how to solve an important special case of the problem.
  • Keywords
    Algorithm design and analysis; Data structures; Merging; Tree graphs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1984. 25th Annual Symposium on
  • Conference_Location
    Singer Island, FL
  • ISSN
    0272-5428
  • Print_ISBN
    0-8186-0591-X
  • Type

    conf

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