Sub-linear time distributed algorithm for minimum-weight spanning trees

Annual Symposium on Foundatons of Computer Science (Proceedings)

Volumn , Issue , 1993, Pages 659-668

  Garay, Juan A ^a   Kutten, Shay ^a   Peleg, David ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; OPTIMAL SYSTEMS; PARAMETER ESTIMATION; TREES (MATHEMATICS);

EDGE ELIMINATION; GRAPH DECOMPOSITION; MINIMUM WEIGHT SPANNING TREE; NETWORK DIAMETER;

ALGORITHMS;

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

References (13)