Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
Takehiro ItoNaonori KakimuraNaoyuki KamiyamaYusuke KobayashiShun-ichi MaezawaYuta NozakiYoshio OkamotoPublished in: CoRR (2023)
Keyphrases
- shortest path
- weighted graph
- shortest path problem
- finding the shortest path
- flow graph
- path length
- strongly connected components
- shortest path algorithm
- edge weights
- random walk
- graph search
- betweenness centrality
- minimum cut
- dynamic programming
- travel time
- road network
- graph model
- geodesic distance
- graph databases
- shortest distance
- connected components
- graph theory
- directed graph
- computational complexity
- knn
- markov chain
- minimum length
- minimal surface
- graph structure
- optimal path
- graph partitioning