Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
Takehiro ItoNaonori KakimuraNaoyuki KamiyamaYusuke KobayashiShun-ichi MaezawaYuta NozakiYoshio OkamotoPublished in: ICALP (2023)
Keyphrases
- shortest path
- shortest path problem
- weighted graph
- finding the shortest path
- flow graph
- path length
- strongly connected components
- betweenness centrality
- minimum cut
- shortest path algorithm
- edge weights
- graph search
- computational complexity
- graph partitioning
- travel time
- graph model
- geodesic distance
- shortest distance
- random walk
- connected components
- graph theory
- maximum flow
- directed graph
- spanning tree
- bi objective
- graph structure
- graph mining
- complex networks
- optimal path
- dynamic programming
- reinforcement learning