Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2005

Highly Cited

2005

Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden… Expand

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… Expand

Highly Cited

1998

Highly Cited

1998

We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomized… Expand

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… Expand

Highly Cited

1994

Highly Cited

1994

Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect… Expand

Highly Cited

1991

Highly Cited

1991

This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain… Expand

Highly Cited

1990

Highly Cited

1990

Abstract Let H be a fixed graph, whose vertices are referred to as ‘colors’. An H-coloring of a graph G is an assignment of… Expand

Highly Cited

1983

Highly Cited

1983

Given a mapping with a sparse Jacobian matrix, the problem of minimizing the number of function evaluations needed to estimate… Expand

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… Expand

Highly Cited

1972

Highly Cited

1972

A finite undirected graph is called chordal if every simple circuit has a chord. Given a chordal graph, we present, ways for… Expand