On the parallel time complexity of undirected connectivity and minimum spanning trees

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 225-234

  Chong, Ka Wong ^a   Han, Yijie ^a   Lam, Tak Wah ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; RANDOM ACCESS STORAGE;

PARALLEL RANDOM ACCESS MEMORY (PRAM); WEIGHTED UNDIRECTED GRAPHS;

TREES (MATHEMATICS);

EID: 0032762081     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)