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.
2014
2014
An Effective Quantum-inspired Evolutionary Algorithm for Finding Degree-constrained Minimum Spanning Tree
— The Degree-constrained Minimum Spanning Tree (d-MST) is an extended adaptation of general Minimum Spanning Tree (MST) problem… 
2013
2013
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those… 
2011
2011
Cellular Competitive Decision Algorithm for Degree-Constrained Minimum Spanning tree Problem
Finding the Degree-Constrained Minimum Spanning Tree(DCMST for short) of a graph is a classical combinatorial optimization hard… 
2007
2007
Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings
Book file PDF easily for everyone and every device. You can download and read online Experimental Algorithms: 6th International… 
2006
2006
An Improved Ant Search Algorithm for Degree-Constrained Minimum Spanning Tree
  • L. San
  • 2006
  • Corpus ID: 125035225
For the degree constrained minimum spanning tree problem, the basic ant algorithm is improved. The concept of degree information… 
2005
2005
Polyhedra and algorithms for the General Routing Problem
Das General Routing Problem ist ein auf ungerichteten Graphen definiertes NP-schweres kombinatorisches Optimierungsproblem. Es… 
2003
2003
Using Lagrangian Dual Information to Generate Degree Constrained Minimum Spanning Trees
In this paper we present a Lagrangian based heuristic for the Degree Constrained Minimum Spanning Tree Problem (DSTP). We show… 
2002
2002
Genetic algorithms of degree-constrained minimum spanning tree problem
Using prufer numbers, a idea of solving problems of degree-constrained minimum spanning tree by genetic algorithms was provided… 
1999
1999
Algorithms for the degree-constrained minimum spanning tree and the hierarchical clustering problems using the nearest-neighbor techniques
In this dissertation, we explore the properties related to the nearest neighbor (NN) technique in the contexts of clustering… 
1997
1997
Approach to Degree Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
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)