Abstract
Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to formulate some general conditions on the sum of vertex degrees. We analyze the performance of various combinations of these degree sum conditions in finding dense spanning subtrees and apply our approach to practical examples. After briefly describing our algorithm we also show how it can be used on variations of DST, motivated by variations of MST. Our work provide some insights on the role of various degree sums in forming dense spanning trees and hopefully lay the foundation for finding fast algorithms or heuristics for related problems.
Original language | English |
---|---|
Article number | e0184912 |
Journal | PLoS ONE |
Volume | 12 |
Issue number | 9 |
DOIs | |
State | Published - Sep 2017 |
Scopus Subject Areas
- General Biochemistry, Genetics and Molecular Biology
- General Agricultural and Biological Sciences
- General