The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations
John D. Eblen, Charles Phillips, Gary L. Rogers et al. · Lecture notes in computer science · 2011
Cited by 13 works. doi:10.1007/978-3-642-21260-4_30
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Emergence of Scaling in Random Networks
- Random Graphs
- Gene Expression Omnibus: NCBI gene expression and hybridization array data repository
- Uncovering the overlapping community structure of complex networks in nature and society
- Algorithm 457: finding all cliques of an undirected graph
- Parameterized Complexity
- On cliques in graphs
- Parameterized Complexity
- The Maximum Clique Problem