Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
Joseph CheriyanLászló A. VéghPublished in: CoRR (2012)
Keyphrases
- minimum cost
- connected subgraphs
- undirected graph
- directed acyclic graph
- spanning tree
- biological networks
- np hard
- network flow
- approximation algorithms
- connected components
- network flow problem
- directed graph
- conditional independence
- capacity constraints
- graph structure
- edit operations
- adjacency matrix
- random graphs
- biological data
- lower bound
- data structure
- data mining
- graph mining
- shortest path
- special case