Graph coloring

Known as: Graph coloring algorithm, Mycielski's theorem, K-coloring 
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1999
Highly Cited
1999
A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms… (More)
  • table 1
  • figure 4
  • figure 5
  • figure 6
  • figure 8
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We describe two improvements to Chaitin-style graph coloring register allocators. The first, optimistic coloring, uses a stronger… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
The problem of computing good graph colorings arises in many diverse applications , such as in the estimation of sparse Jacobians… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We present a graph coloring register allocator designed to minimize the number of dynamic memory references. We cover the program… (More)
  • figure 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden… (More)
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Smallest-last vertex ordering and prlonty search are utdlzed to show for any graph G = (IT, E) that the set of all connected… (More)
  • figure 2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an… (More)
Is this relevant?