- Record: found
- Abstract: not found
- Book Chapter: not found
Algorithms and Computation
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references44
- Record: found
- Abstract: not found
- Article: not found
Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp
Stanley Wasserman, Philippa Pattison (1996)
- Record: found
- Abstract: not found
- Article: not found
Algorithm 457: finding all cliques of an undirected graph
Coen Bron, Joep Kerbosch (1973)
- Record: found
- Abstract: not found
- Book: not found
Parameterized Complexity
R. G. Downey, M. Fellows (1999)
