Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density.
Thomas BöhmeAlexandr V. KostochkaPublished in: Discret. Math. (2009)
Keyphrases
- dense subgraphs
- connected subgraphs
- biological networks
- functional modules
- graph mining
- edge weights
- directed acyclic graph
- biological data
- complex networks
- community discovery
- link prediction
- gene expression
- biological systems
- connected components
- network analysis
- pattern mining
- undirected graph
- protein protein interactions
- community detection
- bipartite graph
- directed graph
- microarray
- weighted graph
- dynamic graph
- complex systems
- network structure