Reconfiguring undirected paths

DOI10.1007/978-3-030-24766-9_26MaRDI QIDQ2285101zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, David Eppstein, Adam Hesterberg, Kshitij Jain, Anna Lubiw, Ryuhei Uehara, Yushi Uno

Publication date 16 January 2020

Full work available at URL https://arxiv.org/abs/1905.00518, https://hdl.handle.net/1721.1/129566

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• Shortest paths between shortest paths
• Reconfiguration in bounded bandwidth and tree-depth
• The complexity of rerouting shortest paths
• Reconfiguration of vertex-disjoint shortest paths on graphs
• The complexity of rerouting shortest paths

Cited in

(15)

• Reconfiguring (non-spanning) arborescences
• Reconfiguring directed trees in a digraph
• The parameterized complexity of motion planning for snake-like robots
• Fixed-parameter algorithms for graph constraint logic
• Shifting paths to avoidable ones
• Fixed-parameter algorithms for graph constraint logic
• Reconfiguration of time-respecting arborescences
• Algorithmic meta-theorems for combinatorial reconfiguration revisited
• Reconfiguration of time-respecting arborescences
• Algorithmic meta-theorems for combinatorial reconfiguration revisited
• Distance-based (and path-based) covering problems for graphs of given cyclomatic number
• Parameterized shortest path reconfiguration
• A graph width perspective on partially ordered Hamiltonian paths and cycles ii: vertex and edge deletion numbers
• On shortest path, \textsf{BFS}- and \textsf{DFS}-tree graphs
• Parity conditions for one-way rail networks

This page was built for publication: Reconfiguring undirected paths

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