Degree-Constrained k-Minimum Spanning Tree Problem
Degree-Constrained k-Minimum Spanning Tree Problem
About this item
Full title
Author / Creator
Publisher
Cairo, Egypt: Hindawi Publishing Corporation
Journal title
Language
English
Formats
Publication information
Publisher
Cairo, Egypt: Hindawi Publishing Corporation
Subjects
More information
Scope and Contents
Contents
Let GV,E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k-minimum spanning tree (DCkMST) problem which consists of finding a minimum cost subtree of G formed with at least k vertices of V where the degree of each vertex is less than or equal to an integer valu...
Alternative Titles
Full title
Degree-Constrained k-Minimum Spanning Tree Problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_9a70c1e572c24b0db823b4d0c1869007
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_9a70c1e572c24b0db823b4d0c1869007
Other Identifiers
ISSN
1076-2787
E-ISSN
1099-0526
DOI
10.1155/2020/7628105
