Shortest reconfiguration sequence for sliding tokens on spiders

DOI10.1007/978-3-030-17402-6_22OpenAlexW3104335265MaRDI QIDQ2294056

Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara

Publication date: 6 February 2020

Full work available at URL: https://arxiv.org/abs/1806.08291

zbMATH Keywords

independent setpolynomial-time algorithmsliding tokenshortest reconfigurationspider tree

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids

This page was built for publication: Shortest reconfiguration sequence for sliding tokens on spiders