241 search results - page 22 / 49 » Degree Bounded Spanning Trees |
124
click to vote
COLOGNETWENTE
2009
15 years 3 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
107
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
114
click to vote
IPL
2002
15 years 1 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
102
click to vote
ICIP
2004
IEEE
16 years 3 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
128
click to vote
IJCM
2002
15 years 1 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...