Sliding token on bipartite permutation graphs
DOI10.1007/978-3-662-48971-0_21zbMATH Open1472.68112OpenAlexW2294088579MaRDI QIDQ3459864FDOQ3459864
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cited In (19)
- On girth and the parameterized complexity of token sliding and token jumping
- On reconfiguration graphs of independent sets under token sliding
- Token sliding on split graphs
- Token sliding on split graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- Independent-set reconfiguration thresholds of hereditary graph classes
- Complexity of token swapping and its variants
- Token sliding on graphs of girth five
- Parameterized complexity of independent set reconfiguration problems
- Introduction to reconfiguration
- Token sliding on graphs of girth five
- On finding short reconfiguration sequences between independent sets
- Sliding tokens on block graphs
- On the complexity of distance-\(d\) independent set reconfiguration
- Title not available (Why is that?)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs
- Galactic token sliding
- Computational complexity of puzzles and related topics
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar
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)
