Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
The tape reconfiguration problem and its consequences for dominating set reconfiguration
Nicolas Bousquet, Quentin Deschamps, Arnaud Mary +2
A dominating set of a graph is a set of vertices whose closed neighborhood is , i.e., . We view a dominating set as a collection of tokens plac…
cs.CC2025
Complexity of the Swap Median and Swap Closest Problems
LuÃs Cunha, Thiago Lopes, Arnaud Mary
Genome rearrangement distances provide a combinatorial framework for comparing genomes represented as permutations. Although the swap distance between two permutations is polynomia…