Semantic Scholar uses AI to extract papers important to this topic.
Tabu search techniques are used for moving step by step towards the minimum value of a function. A tabu list of forbidden… Expand A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary… Expand We consider the problem of coloring <italic>k</italic>-colorable graphs with the fewest possible colors. We present a randomized… Expand We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for… Expand Planar Graphs. Graphs on Higher Surfaces. Degrees. Critical Graphs. The Conjectures of Hadwiger and Hajos. Sparse Graphs. Perfect… Expand This is the second in a series of three papers that empirically examine the competitiveness of simulated annealing in certain… Expand 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 Given a mapping with a sparse Jacobian matrix, the problem of minimizing the number of function evaluations needed to estimate… Expand In a previous paper we reported the successful use of graph coloring techniques for doing global register allocation in an… Expand A finite undirected graph is called chordal if every simple circuit has a chord. Given a chordal graph, we present, ways for… Expand