GECCO
2006
Springer
13 years 8 months ago
2006
Springer
A spanning tree of a graph such that each vertex in the tree has degree at most d is called a degree-constrained spanning tree. The problem of finding the degree-constrained spann...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every