Counting Vertex-Disjoint Shortest Paths in Graphs.
Adi BoteaMassimiliano MattettiAkihiro KishimotoRadu MarinescuElizabeth DalyPublished in: SOCS (2021)
Keyphrases
- shortest path
- edge weights
- finding the shortest path
- betweenness centrality
- weighted graph
- shortest path problem
- directed graph
- shortest path algorithm
- minimum length
- road network
- labeled graphs
- undirected graph
- attributed graphs
- graph search
- geodesic distance
- complex networks
- dynamic programming
- path length
- strongly connected components
- flow graph
- graph theory
- social networks
- minimum cost flow
- pairwise
- spatial networks
- graph model
- graph partitioning
- travel time
- bipartite graph