120 search results - page 1 / 24 » Randomized Lower Bounds for Online Path Coloring |
RANDOM
1998
Springer
13 years 9 months ago
1998
Springer
MFCS
2004
Springer
13 years 10 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
RSA
2011
13 years 3 days ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
