Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs.
Joseph CheriyanLászló A. VéghPublished in: SIAM J. Comput. (2014)
Keyphrases
- minimum cost
- connected subgraphs
- undirected graph
- spanning tree
- biological networks
- np hard
- approximation algorithms
- directed acyclic graph
- network flow
- connected components
- network flow problem
- capacity constraints
- directed graph
- conditional independence
- biological systems
- binary images
- graph matching
- knowledge discovery
- gene expression
- random variables
- strongly connected
- random walk