1 paper
Jan Matyáš Křišťan, Jakub Svoboda
In this paper, we present novel algorithms that efficiently compute a shortest reconfiguration sequence between two given dominating sets in trees and interval graphs under the Tok…