Order Reconfiguration Under Width Constraints
Journal article, Peer reviewed
Published version
Åpne
Permanent lenke
https://hdl.handle.net/11250/2979710Utgivelsesdato
2021Metadata
Vis full innførselSamlinger
- Department of Informatics [917]
- Registrations from Cristin [9489]
Originalversjon
Leibniz International Proceedings in Informatics. 2021, 202, 8:1-8:15. 10.4230/LIPIcs.MFCS.2021.8Sammendrag
In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω' of the vertices of G, can one transform ω into ω' by a sequence of swaps of adjacent elements in such a way that at each time step the resulting linear order has cutwidth (pathwidth) at most k? We show that this problem always has an affirmative answer when the input linear orders ω and ω' have cutwidth (pathwidth) at most k/2. Using this result, we establish a connection between two apparently unrelated problems: the reachability problem for two-letter string rewriting systems and the graph isomorphism problem for graphs of bounded cutwidth. This opens an avenue for the study of the famous graph isomorphism problem using techniques from term rewriting theory.