SAT modulo symmetries for graph generation and enumeration
From MaRDI portal
Publication:6610196
DOI10.1145/3670405MaRDI QIDQ6610196
Markus Kirchweger, Stefan Szeider
Publication date: 25 September 2024
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Ramsey numbersextremal graph theorySAT solvingMurty-Simon conjecturegraph generationdynamic symmetry breaking
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A maximum degree theorem for diameter-2-critical graphs
- Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey
- Diameter critical graphs
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\)
- On diameter 2-critical graphs
- On diameter critical graphs
- Vraagstuk XXVIII.
- Symmetric explanation learning: effective dynamic symmetry handling for SAT
- On a problem of formal logic.
- Excluding symmetries in constraint-based search
- Optimal symmetry breaking for graph problems
- CDCLSym: introducing effective symmetry breaking in SAT solving
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Constraints for symmetry breaking in graph representation
- Exact value of \(\operatorname{ex}(n; \{C_3, \ldots, C_s \})\) for \(n \leq \lfloor \frac{25(s - 1)}{8} \rfloor\)
- Symmetries, almost symmetries, and lazy clause generation
- Breaking symmetries in graph search with canonizing sets
- Efficient certified RAT verification
- Practical graph isomorphism. II.
- Improved Static Symmetry Breaking for SAT
- Propositional SAT Solving
- Dynamic Symmetry Breaking by Simulating Zykov Contraction
- Extremal graphs without three‐cycles or four‐cycles
- R(4, 5) = 25
- Compiling finite domain constraints to SAT withBEE
- Minimum vertex‐diameter‐2‐critical graphs
- Principles and Practice of Constraint Programming – CP 2003
- Using simulated annealing to construct extremal graphs
- Breaking symmetries with high dimensional graph invariants and their combination
- A SAT attack on Rota's basis conjecture
- IPASIR-up: user propagators for CDCL
- A SAT solver's opinion on the Erdős-Faber-Lovász conjecture
- SAT-based generation of panar graphs
This page was built for publication: SAT modulo symmetries for graph generation and enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610196)
