Combinatorial Shortest Path on Graph Associahedra is NP-hard.
Apr 28, 2023
Apr 28, 2023 · We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, is NP-hard.
Jul 5, 2023 · We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, ...
Sep 11, 2024 · We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and ...
We prove that the computation of a combinatorial shortest path between two vertices of a graph associahedron, introduced by Carr and Devadoss, is NP-hard. This ...
May 10, 2024 · With this formulation, rotation distance is exactly the shortest path between two given nodes (corresponding to the two given trees T1 and T2).
1, Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra, Ito, Takehiro et al. ; 2, Reconfiguration of Colorings in Triangulations of the Sphere ...
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. Authors: Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun ...
People also ask
How to find shortest path between two nodes in a weighted graph?
How do you find the shortest path in a graph in data structure?
... Hardness of finding combinatorial shortest paths on graph associahedra, arXiv:2304.14782, 2023. Yusuke Kobayashi and Takashi Noguchi: An approximation ...
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra (with T. Ito, N. Kakimura, N. Kamiyama, Y. Kobayashi, Y. Nozaki, and Y. Okamoto)