scientific article; zbMATH DE number 4187836
From MaRDI portal
Publication:5752591
zbMath0721.05024MaRDI QIDQ5752591
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
combinatorial optimizationtabu searchgraph colouringchromatic numberoptimal colouringsequential colouring techniques
Related Items
Hard-to-color graphs for connected sequential colorings, Time slot scheduling of compatible jobs, A variable neighborhood search for graph coloring., Decomposition of realizable fuzzy relations, The general \(\alpha \)-decomposition problem of fuzzy relations, COSINE: A new graph coloring algorithm, A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic, A semidefinite programming-based heuristic for graph coloring, Efficient algorithms for finding critical subgraphs, An adaptive memory algorithm for the \(k\)-coloring problem, A branch-and-cut algorithm for graph coloring, EPCOT: An efficient procedure for coloring optimally with Tabu Search, Extensions of coloring models for scheduling purposes, Perfectness and imperfectness of unit disk graphs on triangular lattice points, A sequential coloring algorithm for finite sets, Finding maximum cliques in arbitrary and in special graphs
