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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Free space optical (FSO) networking is an attractive technology with applications ranging from high capacity military… (More)
  • table II
  • table III
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
Degree-constrained minimum spanning tree problem is an NP-hard bicriteria combinatorial optimization problem seeking for the… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2012
2012
Computer network technology has been growing explosively and the multicast technology has become a hot Internet research topic… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
2012
2012
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications… (More)
Is this relevant?
2007
2007
The minimum spanning tree (MST) of a graph defines the cheapest subset of edges that keeps the graph in one connected component… (More)
  • figure 1
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The Degree Constrained Minimum Spanning Tree (DCMST) on a graph is the problem of generating a minimum spanning tree with… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
The representation of candidate solutions and the variation operators are fundamental design choices in an evolutionary algorithm… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • table 2
Is this relevant?
1997
1997
The degree-constrained spanning tree problem is of high practical importance. Up to now, there are few effective algorithms to… (More)
  • table I
  • figure 1
  • table II
  • table III
  • table IV
Is this relevant?
1985
1985
We describe a branch and bound algorithm to solve the degree-constrained minimum spanning tree problem. WC propose an edge… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In this paper the problem of a degree-constrained minimum spanning tree (DCMST) is defined. The problem is formulated as a linear… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?