Matrices, shortest paths, minimal cuts and Euclidian metric for undirected graphs.
Victor A. RusakovPublished in: BICA (2018)
Keyphrases
- shortest path
- undirected graph
- geodesic distance
- min cut
- directed graph
- directed acyclic graph
- shortest path algorithm
- approximation algorithms
- road network
- spanning tree
- path length
- minimum cost
- graph structure
- complex networks
- connected components
- optimal path
- vertex set
- finding the shortest path
- weighted graph
- metric space
- minimal surface
- routing algorithm
- minimum cost flow
- flow graph
- spatial networks
- random walk
- data structure
- travel time
- strongly connected components
- dynamic programming
- distance function
- distance matrix
- euclidean distance
- distance metric
- routing problem