Iterative coloring extension of a maximum clique
DOI10.1002/NAV.1033zbMATH Open1009.90121OpenAlexW2114857446MaRDI QIDQ4544221FDOQ4544221
Authors: Massimiliano Caramia, Paolo Dell'Olmo 
Publication date: 12 August 2002
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.1033
Recommendations
- scientific article; zbMATH DE number 956855
- Relaxed approximate coloring in exact maximum clique search
- Bounding vertex coloring by truncatedmultistage branch and bound
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- A fast algorithm for the maximum clique problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Consistency in networks of relations
- A Sufficient Condition for Backtrack-Free Search
- Title not available (Why is that?)
- Network-based heuristics for constraint-satisfaction problems
- Some simplified NP-complete graph problems
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- An introduction to timetabling
- Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
- Chromatic Scheduling and the Chromatic Number Problem
- Title not available (Why is that?)
- Finding maximum cliques in arbitrary and in special graphs
- Genetic and hybrid algorithms for graph coloring
- A Pruning Procedure for Exact Graph Coloring
- Register Allocation in Structured Programs
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Graph coloring with adaptive evolutionary algorithms
Cited In (10)
- Relaxed approximate coloring in exact maximum clique search
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- Bounding vertex coloring by truncatedmultistage branch and bound
- Iterated colorings of graphs.
- Dynamic \(F\)-free coloring of graphs
- Infra-chromatic bound for exact maximum clique search
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- On the queen graphs coloring problem.
- Coloring the Maximal Cliques of Graphs
This page was built for publication: Iterative coloring extension of a maximum clique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544221)
