Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs.
Toshimasa IshiiPublished in: J. Discrete Algorithms (2009)
Keyphrases
- undirected graph
- approximation algorithms
- connected components
- strongly connected
- directed graph
- minimum cost
- spanning tree
- disjoint paths
- vertex set
- greedy algorithm
- complex networks
- directed acyclic graph
- graph structure
- special case
- random graphs
- search algorithm
- binary images
- np hard
- dynamic programming
- probabilistic inference
- random walk
- level set
- linear programming
- markov random field
- graph structures
- adjacency matrix
- data structure
- multicommodity flow