Fixed-Parameter Tractability of Token Jumping on Planar Graphs
From MaRDI portal
Publication:2942629
DOI10.1007/978-3-319-13075-0_17zbMath1432.68195arXiv1406.6567OpenAlexW2147556492MaRDI QIDQ2942629
Takehiro Ito, Hirotaka Ono, Marcin Kaminski
Publication date: 11 September 2015
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.6567
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas ⋮ Reconfiguration of dominating sets ⋮ Reconfiguration on nowhere dense graph classes ⋮ Galactic token sliding ⋮ Parameterized complexity of independent set reconfiguration problems ⋮ Unnamed Item ⋮ On girth and the parameterized complexity of token sliding and Token Jumping ⋮ Reconfiguration on sparse graphs ⋮ On the parameterized complexity of reconfiguration problems ⋮ Unnamed Item ⋮ Incremental optimization of independent sets under the reconfiguration framework ⋮ Independent set reconfiguration parameterized by modular-width ⋮ Token sliding on split graphs ⋮ Introduction to reconfiguration
