Listing all maximal cliques in sparse graphs in near-optimal time.
David EppsteinMaarten LöfflerDarren StrashPublished in: Exact Complexity of NP-hard Problems (2010)
Keyphrases
- maximal cliques
- graph theory
- graph theoretic
- maximal clique enumeration
- maximum clique
- complex networks
- association graph
- protein interaction networks
- massive data
- perturbation theory
- high dimensional
- graph properties
- fully connected
- social network analysis
- functional modules
- network model
- information extraction
- relational databases