Reconfigurations in Graphs and Grids
From MaRDI portal
Publication:5901488
DOI10.1137/060652063zbMath1181.05080OpenAlexW2098637407MaRDI QIDQ5901488
Adrian Dumitrescu, János Pach, Gruia Călinescu
Publication date: 16 March 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060652063
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (20)
On Reconfiguration of Disks in the Plane and Related Problems ⋮ Reconfiguration of List Edge-Colorings in a Graph ⋮ Parameterized complexity of reconfiguration of atoms ⋮ The packing number of the double vertex graph of the path graph ⋮ The connectivity of token graphs ⋮ Token Swapping on Trees ⋮ Space-aware reconfiguration ⋮ Ubiquity of graphs with nowhere‐linear end structure ⋮ 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids ⋮ Solving simultaneous target assignment and path planning efficiently with time-independent execution ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Multi-color pebble motion on graphs ⋮ Independence and matching numbers of some token graphs ⋮ Reconfiguration of list edge-colorings in a graph ⋮ Pebble exchange group of graphs ⋮ Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch ⋮ Independent-set reconfiguration thresholds of hereditary graph classes ⋮ The edge-connectivity of token graphs ⋮ Space-Aware Reconfiguration ⋮ Introduction to reconfiguration
This page was built for publication: Reconfigurations in Graphs and Grids
