Skip to search formSkip to main contentSkip to account menu

Degree-constrained spanning tree

Known as: Degree constrained spanning tree, Degree-constrained spanning tree problem 
In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Degree (graph theory)Graph (discrete mathematics)Graph theoryHamiltonian path problem

Broader (1)

Spanning tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Algebraic connectivity of degree constrained spanning trees for FSO networks
Free space optical (FSO) networking is an attractive technology with applications ranging from high capacity military… 
2009
2009
Continuous-space embedding genetic algorithm applied to the Degree Constrained Minimum Spanning Tree Problem
This work presents an evolutionary approach for solving a difficult problem of combinatorial optimization, the DCMST (Degree… 
2007
2007
Solving Degree-constrained Minimum Spanning Tree with a New Algorithm
The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component… 
Highly Cited
2003
Highly Cited
2003
Edge sets: an effective evolutionary coding of spanning trees
The fundamental design choices in an evolutionary algorithm (EA) are its representation of candidate solutions and the operators… 
Highly Cited
2001
Highly Cited
2001
Comparison of Algorithms for the Degree Constrained Minimum Spanning Tree
The Degree Constrained Minimum Spanning Tree (DCMST) on a graph is the problem of generating a minimum spanning tree with… 
Highly Cited
2000
Highly Cited
2000
An efficient evolutionary algorithm for the degree-constrained minimum spanning tree problem
  • G. Raidl
  • Proceedings of the Congress on Evolutionary…
  • 2000
  • Corpus ID: 7896676
The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm… 
Highly Cited
2000
Highly Cited
2000
A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper… 
Highly Cited
1999
Highly Cited
1999
A new evolutionary approach to the degree-constrained minimum spanning tree problem
Finding the degree-constrained minimum spanning tree (d-MST) of a graph is a well-studied NP-hard problem of importance in… 
1997
1997
A note on genetic algorithms for degree-constrained spanning tree problems
The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to… 
Highly Cited
1980
Highly Cited
1980
Degree-constrained minimum spanning tree
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)