Breaking Symmetries in Graph Search with Canonizing Sets

There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of the large number of isomorphic representations of their solutions... (read more)

Results in Papers With Code
(↓ scroll down to see all results)