SAT-boosted tabu search for coloring massive graphs
From MaRDI portal
Publication:6579769
DOI10.1145/3603112MaRDI QIDQ6579769FDOQ6579769
Authors: André Schidler, Stefan Szeider 
Publication date: 26 July 2024
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Cites Work
- Reducibility among combinatorial problems
- Efficient CNF encoding of Boolean cardinality constraints
- The complexity of theorem-proving procedures
- New methods to color the vertices of a graph
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A supernodal formulation of vertex colouring with applications in course timetabling
- On the complexity of some colorful problems parameterized by treewidth
- Title not available (Why is that?)
- Solving the maximum clique and vertex coloring problems on very large sparse networks
- Improving the extraction and expansion method for large graph coloring
- 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
- A hybrid approach for exact coloring of massive graphs
- A SAT approach to branchwidth
- Shadoks approach to minimum partition into plane subgraphs (CG challenge)
- Conflict-based local search for minimum partition into plane subgraphs (CG challenge)
- Local search with weighting schemes for the CG:SHOP 2022 competition (CG challenge)
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- SAT-based circuit local improvement
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)
