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

The Minimum Spanning Tree (MST) problem with an added constraint that no node in the spanning tree has the degree more than a specified integer d, is known as the Degree-Constrained MST (d-MST) problem. Since computing the d-MST is NP-hard for every d in the range 2/spl les/d/spl les/(n-2) where n d...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / International Symposium on Parallel Architectures, Algorithms, and Networks (ISPAN) s. 184 - 189
Hlavní autori:	Mao, Li-Jen, Deo, Narsingh, Lang, Sheau-Dong
Médium:	Konferenčný príspevok.. Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 1999
Predmet:	Additives Approximation algorithms Computer science Nearest neighbor searches NP-hard problem Parallel algorithms Polynomials Silicon compounds Traveling salesman problems Tree graphs
ISBN:	0769502318, 9780769502311
ISSN:	1087-4089
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!