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
A Solution of Degree Constrained Spanning Tree Using Hybrid GA
In real life, it is always an urge to reach our goal in minimum effort i.e., it should have a minimum constrained path. The path… 
2013
2013
Genetic programming based degree constrained spanning tree extraction
The problem of extracting a degree constraint spanning tree deals with extraction of a spanning tree from a given graph. Where… 
2012
2012
An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The degree-constrained minimum spanning tree (DCMST) problem is the problem of finding the minimum cost spanning tree in an edge… 
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… 
2008
2008
Ant Colony Optimization Approaches to the Degree-constrained Minimum Spanning Tree Problem
This paper presents the design of two Ant Colony Optimization (ACO) approaches and their improved variants on the 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… 
2007
2007
Probabilistic Analysis of the Degree Bounded Minimum Spanning Tree Problem
In the b-degree constrained Euclidean minimum spanning tree problem (bMST) we are given n points in [0, 1]d and a degree… 
2004
2004
A New Encoding for the Degree Constrained Minimum Spanning Tree Problem
We present an effective new encoding method for use by black-box optimisation methods when addressing tree-based combinatorial… 
2003
2003
A new genetic algorithm with local search method for degree-constrained minimum spanning tree problem
A new evolutionary algorithm for degree-constrained minimum spanning tree problem, which is an NP-complete problem, is proposed… 
1996
1996
Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree
The degree constrained minimum spanning tree on a graph is the problem of generating a minimum spanning tree with constraints on… 
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)