Communication-optimal parallel minimum spanning tree algorithms extended abstract

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 1998, Pages 27-36

  Adler, M ^a   Dittrich, W ^a   Juurlink, B ^a   Kutylowski, M ^a   Rieping, I ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION; GRAPH THEORY; MULTIPROCESSING SYSTEMS; PROBABILITY; RANDOM PROCESSES;

MINIMUM SPANNING TREE;

PARALLEL ALGORITHMS;

EID: 0031634978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/277651.277662     Document Type: Conference Paper

References (28)