SAT-boosted tabu search for coloring massive graphs
From MaRDI portal
Publication:6579769
Cites work
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- A SAT approach to branchwidth
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A hybrid approach for exact coloring of massive graphs
- A supernodal formulation of vertex colouring with applications in course timetabling
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
- Efficient CNF encoding of Boolean cardinality constraints
- Improving the extraction and expansion method for large graph coloring
- Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- New methods to color the vertices of a graph
- On the complexity of some colorful problems parameterized by treewidth
- Reducibility among combinatorial problems
- SAT-based circuit local improvement
- SAT-based local improvement for finding tree decompositions of small width
- SAT-encodings for special treewidth and pathwidth
- SAT-encodings for treecut width and treedepth
- Shadoks approach to minimum partition into plane subgraphs (CG challenge)
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- The complexity of theorem-proving procedures
This page was built for publication: SAT-boosted tabu search for coloring massive graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579769)
