39 citations · 42 across the 4 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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…
cs.DM2014★ 39 cited
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)
Michael Codish, Luís Cruz-Filipe, Michael Frank +1
This paper describes a computer-assisted non-existence proof of nine-input sorting networks consisting of 24 comparators, hence showing that the 25-comparator sorting network found…