![]() |
In this paper, we consider a set of symmetry breaking constraints for models searching a graph with given property, and show that they are all satisfied by at least one representative of each isomorphism class.
Bibtex entry:
AUTHOR | = | {Madarasi, P{\'e}ter}, |
TITLE | = | {Symmetry breaking when searching a graph with given property}, |
NOTE | = | {{\tt egres.elte.hu}}, |
INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
YEAR | = | {2020}, |
NUMBER | = | {QP-2020-01} |