Token Swapping on Trees

The input to the token swapping problem is a graph with vertices $v_1, v_2, \ldots, v_n$, and $n$ tokens with labels $1, 2, \ldots, n$, one on each vertex. The goal is to get token $i$ to vertex $v_i$ for all $i= 1, \ldots, n$ using a minimum number of swaps, where a swap exchanges the tokens on the...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete mathematics and theoretical computer science Ročník 24, no 2; číslo Discrete Algorithms
Hlavní autori:	Biniaz, Ahmad, Jain, Kshitij, Lubiw, Anna, Masárová, Zuzana, Miltzow, Tillmann, Mondal, Debajyoti, Naredla, Anurag Murty, Tkadlec, Josef, Turcotte, Alexi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Discrete Mathematics & Theoretical Computer Science 2023
Predmet:	03d15, 05c05, 68r05 computer science - computational complexity computer science - data structures and algorithms f.2.0
ISSN:	1365-8050, 1365-8050
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!