Sliding token on bipartite permutation graphs

DOI10.1007/978-3-662-48971-0_21MaRDI QIDQ3459864zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Linear-time algorithm for sliding tokens on trees
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs
• Shortest Reconfiguration of Sliding Tokens on a Caterpillar
• Sliding tokens on block graphs
• Polynomial-time algorithm for sliding tokens on trees

Cited in

(23)

• Independent-set reconfiguration thresholds of hereditary graph classes
• On girth and the parameterized complexity of token sliding and token jumping
• Token sliding on split graphs
• Parameterized complexity of independent set reconfiguration problems
• Introduction to reconfiguration
• Shortest reconfiguration of sliding tokens on subclasses of interval graphs
• Shortest Reconfiguration of Sliding Tokens on a Caterpillar
• Sliding tokens on block graphs
• Token sliding on split graphs
• Token sliding on graphs of girth five
• scientific article; zbMATH DE number 7765402 (Why is no real title available?)
• On the complexity of distance-\(d\) independent set reconfiguration
• Galactic token sliding
• On reconfiguration graphs of independent sets under token sliding
• Token sliding on graphs of girth five
• Computational complexity of puzzles and related topics
• On the complexity of distance-\(d\) independent set reconfiguration
• On finding short reconfiguration sequences between independent sets
• Galactic token sliding
• Independent set reconfiguration in H-free graphs
• A survey on the parameterized complexity of reconfiguration problems
• Complexity of token swapping and its variants
• Independent set reconfiguration on directed graphs

This page was built for publication: Sliding token on bipartite permutation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3459864)