# Graph coloring

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

1999

Highly Cited

1999

- J. Comb. Optim.
- 1999

A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionaryâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- J. Heuristics
- 1998

This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithmsâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- INFORMS Journal on Computing
- 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

- ACM Trans. Program. Lang. Syst.
- 1994

We describe two improvements to Chaitin-style graph coloring register allocators. The first, optimistic coloring, uses a strongerâ€¦Â (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- SIAM J. Scientific Computing
- 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

- PLDI
- 1991

We present a graph coloring register allocator designed to minimize the number of dynamic memory references. We cover the programâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Computing
- 1987

Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbiddenâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- J. ACM
- 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)

Is this relevant?

Highly Cited

1982

Highly Cited

1982

- Best of PLDI
- 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

- SIGPLAN Symposium on Compiler Construction
- 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?