Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs.
Toshimasa IshiiPublished in: ISAAC (2007)
Keyphrases
- undirected graph
- approximation algorithms
- connected components
- strongly connected
- minimum cost
- directed graph
- spanning tree
- binary images
- search algorithm
- disjoint paths
- directed acyclic graph
- vertex set
- special case
- complex networks
- random graphs
- adjacency matrix
- np hard
- graph structure
- greedy algorithm
- dynamic programming
- closed form
- worst case
- input image