5 citations · 6 across the 3 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2022
Reconfiguration of Digraph Homomorphisms
Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
For a fixed graph H, the H-Recoloring problem asks whether for two given homomorphisms from a graph G to H, we can transform one into the other by changing the image of a single ve…
cs.DM2015★ 5 cited
On the Connectedness of Clash-free Timetables
Moritz Mühlenthaler, Rolf Wanka
We investigate the connectedness of clash-free timetables with respect to the Kempe-exchange operation. This investigation is related to the connectedness of the search space of ti…