Pages that link to "Item:Q2331101"
From MaRDI portal
The following pages link to Constraints for symmetry breaking in graph representation (Q2331101):
Displaying 11 items.
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452) (← links)
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking (Q2398438) (← links)
- Generating effective symmetry-breaking predicates for search problems (Q2643299) (← links)
- Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Induction and Exploitation of Subgoal Automata for Reinforcement Learning (Q5856492) (← links)
- Radius \(r\) extremal graphs of girth 5 (Q6562417) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)