Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 211,175,675 papers from all fields of science

Search

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…

Highly Cited

1998

Highly Cited

1998

We consider the problem of coloring k-colorable graphs with the fewest possible colors. We give a randomized polynomial time…

Highly Cited

1994

Highly Cited

1994

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

Highly Cited

1992

Highly Cited

1992

Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In…

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…

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…

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…

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…

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…

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…