Finding minimum spanning forests in logarithmic time and linear work using random sampling

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 1996, Pages 243-250

  Cole, Richard ^a   Klein, Philip N ^a   Tarjan, Robert E ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; RANDOM ACCESS STORAGE; RANDOM PROCESSES;

MINIMUM SPANNING FORESTS; PARALLEL RANDOM ACCESS MEMORY (PRAM); RANDOM SAMPLING;

PARALLEL ALGORITHMS;

EID: 0030387155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237502.237563     Document Type: Conference Paper

References (30)