Sliding Token on Bipartite Permutation Graphs

DOI10.1007/978-3-662-48971-0_21zbMath1472.68112OpenAlexW2294088579MaRDI QIDQ3459864

Duc A. Hoang, Ryuhei Uehara, Eli Fox-Epstein, Yota Otachi

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Shortest reconfiguration of sliding tokens on subclasses of interval graphs, Token sliding on graphs of girth five, On the complexity of distance-\(d\) independent set reconfiguration, Galactic token sliding, Parameterized complexity of independent set reconfiguration problems, On reconfiguration graphs of independent sets under token sliding, Token sliding on graphs of girth five, Unnamed Item, Sliding Tokens on Block Graphs, On girth and the parameterized complexity of token sliding and Token Jumping, Unnamed Item, Complexity of token swapping and its variants, Shortest Reconfiguration of Sliding Tokens on a Caterpillar, Independent-set reconfiguration thresholds of hereditary graph classes, Independent set reconfiguration parameterized by modular-width, Token sliding on split graphs, Introduction to reconfiguration