7 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.CC2014★ 2 cited
Shortest reconfiguration paths in the solution space of Boolean formulas
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak +1
Given a Boolean formula and a satisfying assignment, a flip is an operation that changes the value of a variable in the assignment so that the resulting assignment remains satisfyi…
cs.DS2014★ 4 cited
A Hybrid Graph Representation for Exact Graph Algorithms
Faisal N. Abu-Khzam, Karim A. Jahed, Amer E. Mouawad
Many exact search algorithms for NP-hard graph problems adopt the old Davis-Putman branch-and-reduce paradigm. The performance of these algorithms often suffers from the increasing…
cs.CC2014★ 7 cited
The Complexity of Bounded Length Graph Recoloring
Paul Bonsma, Amer E. Mouawad
We study the following question: Given are two -colorings and of a graph on vertices, and integer . The question is whether can be modified into , b…