Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

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… Expand
  • table II
  • table III
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2007
2007
A New Tree Encoding for the Degree-Constrained Spanning Tree Problem
The degree-constrained minimum spanning tree (dc- MST) problem is of high practical importance. Up to now there are few effective… Expand
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
2006
2006
Using Lagrangian dual information to generate degree constrained spanning trees
In this paper, a Lagrangian-based heuristic is proposed for the degree constrained minimum spanning tree problem. The heuristic… Expand
Is this relevant?
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… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
Is this relevant?
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… Expand
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
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… Expand
  • table I
  • figure 1
  • table II
  • table III
  • table IV
Is this relevant?
Highly Cited
1980
Highly Cited
1980
Degree-constrained minimum spanning tree
Abstract In this paper the problem of a degree-constrained minimum spanning tree (DCMST) is defined. The problem is formulated as… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE