130 search results - page 3 / 26 » Online Coloring Known Graphs |
COMBINATORICA
2010
13 years 6 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
SODA
1992
ACM
13 years 9 months ago
1992
ACM
ESA
2006
Springer
14 years 6 days ago
2006
Springer
We consider the following vertex coloring problem. We are given an undirected graph G = (V, E), where each vertex v is associated with a penalty rejection cost rv. We need to choos...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
ENDM
2006
13 years 8 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...