A Game Theoretic Approach for Efficient Graph Coloring

@inproceedings{Panagopoulou2008AGT,
  title={A Game Theoretic Approach for Efficient Graph Coloring},
  author={Panagiota N. Panagopoulou and Paul G. Spirakis},
  booktitle={ISAAC},
  year={2008}
}
We give an efficient local search algorithm that computes a good vertex coloring of a graph G. In order to better illustrate this local search method, we view local moves as selfish moves in a suitably defined game. In particular, given a graph G = (V, E) of n vertices and m edges, we define the graph coloring game Γ (G) as a strategic game where the set of players is the set of vertices and the players share the same action set, which is a set of n colors. The payoff that a vertex v receives… CONTINUE READING
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

On minimum-collisions assignment in heterogeneous self-organizing networks

2014 IEEE Global Communications Conference • 2014
View 5 Excerpts
Highly Influenced

Strategic Coloring of a Graph

View 10 Excerpts
Highly Influenced

Computing and Combinatorics

Lecture Notes in Computer Science • 2018
View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…