scientific article; zbMATH DE number 956855
From MaRDI portal
zbMath0866.05025MaRDI QIDQ5687263
Publication date: 8 July 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items
Lower bounding techniques for DSATUR-based branch and bound, A DSATUR-based algorithm for the equitable coloring problem, A Wide Branching Strategy for the Graph Coloring Problem, An enumerative algorithm for the frequency assignment problem, An exact approach for the vertex coloring problem, CHECKCOL: improved local search for graph coloring, A cutting plane algorithm for graph coloring, Coloring graphs by iterated local search traversing feasible and infeasible solutions, Solving the minimum-weighted coloring problem, Hybrid evolutionary algorithm for the b-chromatic number, Embedding a novel objective function in a two-phased local search for robust vertex coloring, A new \textsf{DSATUR}-based algorithm for exact vertex coloring, An exact method for graph coloring, A branch-and-cut algorithm for graph coloring, Combinatorial optimization in system configuration design, A network-flow-based lower bound for the minimum weighted integer coloring problem
