Randomized online graph coloring

Authors:
S. Vishwanathan
Affiliations:
Dept. of Comput. Sci., Chicago Univ., IL, USA
Venue:
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Year:
1990

Citing 0
Cited 3

Randomized Lower Bounds for Online Path Coloring

RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Cell association and interference coordination in heterogeneous LTE-A cellular networks

IEEE Journal on Selected Areas in Communications - Special issue on cooperative communications in MIMO cellular networks
A tight bound for online coloring of disk graphs

SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that randomization helps in coloring graphs online, and a simple randomized online algorithm is presented. For 3-colorable graphs the expected number of colors the algorithm uses is O((n log n)/sup 1/2/). The algorithm runs in polynomial time and compares well with the best known polynomial-time offline algorithms. A lower bound is proved for the randomized algorithm.