Efficient algorithms for finding critical subgraphs
From MaRDI portal
Publication:2467361
DOI10.1016/J.DAM.2006.07.019zbMATH Open1130.05055OpenAlexW2034904496MaRDI QIDQ2467361FDOQ2467361
Alain Hertz, Christian Desrosiers, P. Galinier
Publication date: 21 January 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.019
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Tabu Search—Part I
- Irreducibly inconsistent systems of linear inequalities
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Hybrid evolutionary algorithms for graph coloring
- Tabu Search—Part II
- A Column Generation Approach for Graph Coloring
- Using tabu search techniques for graph coloring
- Advances in sensitivity analysis and parametric programming
- An adaptive memory algorithm for the \(k\)-coloring problem
- Finding the chromatic number by means of critical graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Genetic and hybrid algorithms for graph coloring
- Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
- The logic of constraint satisfaction
- Solution techniques for the large set covering problem
Cited In (12)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An exact method for graph coloring
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Solution techniques for the large set covering problem
- Title not available (Why is that?)
- The maximum-impact coloring polytope
- An exact algorithm with learning for the graph coloring problem
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- Finding even subgraphs even faster
- Variable space search for graph coloring
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- A survey on vertex coloring problems
Uses Software
This page was built for publication: Efficient algorithms for finding critical subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467361)
