The degree constrained k-cardinality minimum spanning tree problem: a lexi-search algorithm
This paper deals with the degree constrained k-cardinality minimum spanning tree (k-MSTPD) problem defined on a connected, edge weighted and undirected graph. The aim of this problem is to determine the least weighted spanning tree with exactly k vertices such that except the root vertex, no other v...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2018-10-01
|
| Series: | Decision Science Letters |
| Subjects: | |
| Online Access: | http://www.growingscience.com/dsl/Vol7/dsl_2017_27.pdf |