Parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chains

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 1999, Pages 184-189

  Mao, Li Jen ^a   Deo, Narsingh ^a   Lang, Sheau Dong ^a  

^a UNIVERSITY OF CENTRAL FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA STRUCTURES; GRAPH THEORY; RESPONSE TIME (COMPUTER SYSTEMS);

MINIMUM SPANNING TREE; NEAREST NEIGHBOR CHAINS;

PARALLEL ALGORITHMS;

EID: 0033363591     PISSN: 10874089     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)