• DocumentCode
    2892829
  • Title

    Connected components in O(lg3/2|V|) parallel time for the CREW PRAM

  • Author

    Johnson, D.B. ; Metaxas, P.

  • Author_Institution
    Dartmouth Coll., Hanover, NH
  • fYear
    1991
  • fDate
    1-4 Oct 1991
  • Firstpage
    688
  • Lastpage
    697
  • Abstract
    Computing the connected components of an undirected graph G =(V, E) on |V|=n vertices and | E| =m edges is addressed. An efficient and simple algorithm that runs in O(lg3/2 n) time using n+m CREW processors is presented
  • Keywords
    computational complexity; graph theory; parallel algorithms; CREW PRAM; CREW processors; connected components; edges; parallel time; undirected graph; vertices; Algorithm design and analysis; Computer science; Concurrent computing; Educational institutions; Joining processes; Mathematics; Parallel algorithms; Phase change random access memory; Process design; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
  • Conference_Location
    San Juan
  • Print_ISBN
    0-8186-2445-0
  • Type

    conf

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