Constraints for symmetry breaking in graph representation
From MaRDI portal
Publication:2331101
Recommendations
Cites work
- Algorithms and complexity results for finding graphs with extremal Randić index
- Compiling finite domain constraints to SAT with BEE
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Diamond-free degree sequence
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Exact values of \(ex(\nu ; \{C_{3},C_{4},\dots ,C_n\})\)
- Exploiting symmetries within constraint satisfaction search
- Extremal graphs without three‐cycles or four‐cycles
- Generating effective symmetry-breaking predicates for search problems
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 109192 (Why is no real title available?)
- New families of graphs without short cycles and large size
- On extremal unicyclic molecular graphs with prescribed girth and minimal Hosoya index
- On the complexity of submap isomorphism and maximum common submap problems
- On the maximal triangle-free edge-chromatic graphs in three colors
- Practical graph isomorphism. II.
- Principles and Practice of Constraint Programming – CP 2003
- Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\)
- Using simulated annealing to construct extremal graphs
Cited in
(15)- Optimal symmetry breaking for graph problems
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs
- Breaking symmetries in graph search with canonizing sets
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking
- Generating effective symmetry-breaking predicates for search problems
- Symmetry breaking constraints for the minimum deficiency problem
- Breaking instance-independent symmetries in exact graph coloring
- Finding the hardest formulas for resolution
- Induction and exploitation of subgoal automata for reinforcement learning
- Breaking symmetries with high dimensional graph invariants and their combination
- Radius \(r\) extremal graphs of girth 5
- SAT modulo symmetries for graph generation and enumeration
- Satsuma: structure-based symmetry breaking in SAT
- Breaking symmetries from a set-covering perspective
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem
This page was built for publication: Constraints for symmetry breaking in graph representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331101)
