2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.AI2015
Breaking Symmetries in Graph Search with Canonizing Sets
Avraham Itzhakov, Michael Codish
There are many complex combinatorial problems which involve searching for an undirected graph satisfying given constraints. Such problems are often highly challenging because of th…
cs.AI2015★ 1 cited
Computing the Ramsey Number R(4,3,3) using Abstraction and Symmetry breaking
Michael Codish, Michael Frank, Avraham Itzhakov +1
The number is often presented as the unknown Ramsey number with the best chances of being found "soon". Yet, its precise value has remained unknown for almost 50 years.…
cs.AI2014★ 2 cited
Solving Graph Coloring Problems with Abstraction and Symmetry
Michael Codish, Michael Frank, Avraham Itzhakov +1
This paper introduces a general methodology, based on abstraction and symmetry, that applies to solve hard graph edge-coloring problems and demonstrates its use to provide further…