Sliding Tokens on a Cactus

DOI10.4230/LIPIcs.ISAAC.2016.37zbMath1398.05199OpenAlexW2579505651MaRDI QIDQ4636520

Ryuhei Uehara, Duc A. Hoang

Publication date: 19 April 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6807/pdf/LIPIcs-ISAAC-2016-37.pdf/

zbMATH Keywords

independent setcactusreconfiguration problemtoken sliding

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Invitation to combinatorial reconfiguration ⋮ Shortest reconfiguration of sliding tokens on subclasses of interval graphs ⋮ Parameterized complexity of independent set reconfiguration problems ⋮ Reconfiguration of cliques in a graph ⋮ Sliding Tokens on Block Graphs ⋮ Unnamed Item ⋮ Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Independent set reconfiguration parameterized by modular-width ⋮ Token sliding on split graphs ⋮ Introduction to reconfiguration

This page was built for publication: Sliding Tokens on a Cactus