The shortest path reconfiguration problem based on relaxation of reconfiguration rules

DOI10.1007/978-981-97-0566-5_17MaRDI QIDQ6575398

Naoki Domon, Yuma Tamura, Xiao Zhou, Akira Suzuki

Publication date: 19 July 2024

zbMATH Keywords

shortest pathgraph algorithmparameterized complexityreconfiguration problem

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• The complexity of rerouting shortest paths
• On the complexity of reconfiguration problems
• Solving MAX-\(r\)-SAT above a tight lower bound
• Shortest paths between shortest paths
• Parameterizing above or below guaranteed values
• Reconfiguration graphs of shortest paths
• Reconfiguration in bounded bandwidth and tree-depth
• Introduction to reconfiguration
• Rerouting shortest paths in planar graphs
• Relationships between nondeterministic and deterministic tape complexities
• The complexity of change
• Parameterizing above Guaranteed Values: MaxSat and MaxCut

This page was built for publication: The shortest path reconfiguration problem based on relaxation of reconfiguration rules

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