Publication:4606338
From MaRDI portal
DOI10.4230/LIPIcs.ESA.2016.66zbMath1397.68146arXiv1602.05150MaRDI QIDQ4606338
Takeaki Uno, Lothar Narins, Tillmann Miltzow, Antonis Thomas, Yoshio Okamoto, Günter Rote
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1602.05150
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Sequentially Swapping Colored Tokens on Graphs, The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant, Unnamed Item, Shortest Reconfiguration of Perfect Matchings via Alternating Cycles, Connecting the dots (with minimum crossings), Token Swapping on Trees, Reconfiguration of connected graph partitions, Improving quantum computation by optimized qubit routing, Algorithmic theory of qubit routing, Complexity of token swapping and its variants, Swapping colored tokens on graphs, Introduction to reconfiguration, How to sort by walking and swapping on paths and trees, The Time Complexity of the Token Swapping Problem and Its Parallel Variants
