scientific article; zbMATH DE number 956853
From MaRDI portal
Publication:5687261
zbMath0862.90122MaRDI QIDQ5687261
Publication date: 22 January 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Coloring of graphs and hypergraphs (05C15)
Related Items (13)
The hardest constraint problems: A double phase transition ⋮ Simple decentralized graph coloring ⋮ CHECKCOL: improved local search for graph coloring ⋮ An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem ⋮ Generalised graph colouring by a hybrid of local search and constraint programming ⋮ Coloring graphs by iterated local search traversing feasible and infeasible solutions ⋮ Another look at graph coloring via propositional satisfiability ⋮ Exploiting relaxation in local search for LABS ⋮ Embedding a novel objective function in a two-phased local search for robust vertex coloring ⋮ An incremental search heuristic for coloring vertices of a graph ⋮ An adaptive, multiple restarts neural network algorithm for graph coloring ⋮ A search space ``cartography for guiding graph coloring heuristics ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
This page was built for publication:
