12 search results - page 1 / 3 » Randomized path coloring on binary trees |
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
COLOGNETWENTE
2009
13 years 5 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...
CPC
2002
13 years 4 months ago
2002
The Wiener index is analyzed for random recursive trees and random binary search trees in the uniform probabilistic models. We obtain the expectations, asymptotics for the varianc...
COMBINATORICA
2011
12 years 4 months ago
2011
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...