Finding a contra-risk path between two nodes in undirected graphs.

Mehdi Ghiyasvand Iman Keshtkar

Published in: J. Comb. Optim. (2016)

Keyphrases

undirected graph
strongly connected
directed graph
disjoint paths
minimum cost
connected components
graph structure
directed acyclic graph
spanning tree
complex networks
approximation algorithms
shortest path
random graphs
np hard
adjacency matrix
edge weights
labeling scheme
average degree
random walk