Pages that link to "Item:Q2009225"
From MaRDI portal
The following pages link to Optimal symmetry breaking for graph problems (Q2009225):
Displaying 11 items.
- Complete symmetry breaking constraints for the class of uniquely Hamiltonian graphs (Q2152271) (← links)
- Constraints for symmetry breaking in graph representation (Q2331101) (← links)
- Breaking symmetries in graph search with canonizing sets (Q2398437) (← links)
- Generating effective symmetry-breaking predicates for search problems (Q2643299) (← links)
- The cost of symmetry in connected graphs (Q2680748) (← links)
- (Q4475703) (← links)
- Efficient Lifting of Symmetry Breaking Constraints for Complex Combinatorial Problems (Q5038464) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
- Symmetry Breaking for Maximum Satisfiability (Q5505539) (← links)
- Weak symmetry breaking and abstract simplex paths (Q5740661) (← links)
- SAT modulo symmetries for graph generation and enumeration (Q6610196) (← links)