Reconfiguring shortest paths in graphs
From MaRDI portal
Cites work
- A Helly theorem in weakly modular space
- A mathematical formulation and complexity considerations for the blocks relocation problem
- A simpler linear-time recognition of circular-arc graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Algorithms for solving Rubik's cubes
- An Efficient Test for Circular-Arc Graphs
- Applying the corridor method to a blocks relocation problem
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
- Conditions for invariance of set diameters under d-convexification in a graph
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Container stowage planning: a methodology for generating computerised solutions
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Deflection routing in hypercube networks
- Distance-preserving subgraphs of interval graphs
- Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard
- Graph Classes: A Survey
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 5734726 (Why is no real title available?)
- scientific article; zbMATH DE number 26592 (Why is no real title available?)
- Introduction to reconfiguration
- Minimizing delays in a shunting yard
- Movement Problems for 2-Dimensional Linkages
- On local convexity in graphs
- On the complexity of container stowage planning problems
- Packet routing in fixed-connection networks: A survey
- Permutation Graphs and Transitive Graphs
- Reach for \(A^\ast\): efficient point-to-point shortest path algorithms
- Reconfiguration graphs of shortest paths
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- Reducing Multiple Object Motion Planning to Graph Searching
- Rerouting shortest paths in planar graphs
- SHARC, fast and robust unidirectional routing
- Shortest paths between shortest paths
- Shortest Paths between Shortest Paths and Independent Sets
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Solving the Rubik's Cube Optimally is NP-complete
- Solving the train marshalling problem by inclusion-exclusion
- Stowage planning for container ships to reduce the number of shifts
- The complexity of independent set reconfiguration on bipartite graphs
- The complexity of rerouting shortest paths
- The train marshalling problem
Cited in
(2)
This page was built for publication: Reconfiguring shortest paths in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623589)
