121 search results - page 6 / 25 » Upper Bounds on Number of Steals in Rooted Trees |
118
click to vote
WAOA
2007
Springer
15 years 8 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
103
click to vote
ALGORITHMICA
2004
15 years 1 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
116
click to vote
STACS
1999
Springer
15 years 6 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
106
click to vote
ICCNMC
2005
Springer
15 years 7 months ago
2005
Springer
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
AAAI
2006
15 years 3 months ago
2006
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...