7 citations · 13 across the 3 of their papers we have counts for
4 papers · 1 filter
Parameterized Shortest Path Reconfiguration
Nicolas Bousquet, Kshitij Gajjar, Abhiruk Lahiri +1
An st-shortest path, or st-path for short, in a graph G is a shortest (induced) path from s to t in G. Two st-paths are said to be adjacent if they differ on exactly one vertex. A…
On Solution Discovery via Reconfiguration
Michael R. Fellows, Mario Grobler, Nicole Megow +5
The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current…
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…
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…