Title of article
md-MST is NP-hard for
Author/Authors
de Almeida، نويسنده , , Ana Maria and Martins، نويسنده , , Pedro and Souza، نويسنده , , Maurيcio C. and Palhares، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
9
To page
15
Abstract
Let G = ( V , E ) be a connected weighted undirected graph. Given a positive integer d, the Min-Degree Constrained Minimum Spanning Tree (md-MST) problem consists in finding a spanning tree T for G having minimum total edge cost and such as each node i in the tree either has degree at least d or is a leaf node. In the present work we prove that this recently introduced combinatorial problem is NP-hard in general.
Keywords
spanning tree , node degree constraints , computational complexity , proof by reduction
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2010
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455338
Link To Document