213 search results - page 6 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
IJCM
2010
15 years 2 months ago
2010
152
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
136
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
108
click to vote
FOCS
1996
IEEE
15 years 8 months ago
1996
IEEE
In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...
105
click to vote
TALG
2008
15 years 4 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...