Parallel algorithms for the degree-constrained minimum spanning tree problem using nearest-neighbor chains and the heap-traversal technique

The degree-constrained minimum spanning tree (d-MST) problem attempts to find a minimum spanning tree with an added constraint that no nodes in the tree have a degree larger than a specified integer d. It is known that computing the d-MST is NP-hard for every d in the range 2 /spl les/ d /spl les/ (...

Full description

Bibliographic Details

Published in:	Proceedings. International Conference on Parallel Processing Workshop pp. 398 - 404
Main Authors:	Li-Jen Mao, Sheau-Dong Lang
Format:	Conference Proceeding
Language:	English
Published:	IEEE 2002
Subjects:	Computer science Heuristic algorithms Information management Iterative algorithms Lagrangian functions Nearest neighbor searches Neural networks Parallel algorithms Traveling salesman problems Tree graphs
ISBN:	9780769516806, 0769516807
ISSN:	1530-2016
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!