What features really make distributed minimum spanning tree algorithms efficient?

Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 1996, Pages 106-114

  Faloutsos, Michalis ^a   Molle, Mart ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

DISTRIBUTED INFORMATION; MESSAGE COMPLEXITY; MINIMUM SPANNING TREE;

ALGORITHMS;

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

References (0)