Finding an anti-risk path between two nodes in undirected graphs.
Peng XiaoYinfeng XuBing SuPublished in: J. Comb. Optim. (2009)
Keyphrases
- undirected graph
- strongly connected
- directed graph
- minimum cost
- disjoint paths
- spanning tree
- directed acyclic graph
- graph structure
- approximation algorithms
- random graphs
- connected components
- root node
- complex networks
- np hard
- average degree
- shortest path
- probability distribution
- labeling scheme
- adjacency matrix
- vertex set
- hidden markov models
- upper bound
- probabilistic model
- weighted graph