Listing All Maximal Cliques in Large Sparse Real-World Graphs
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 364-375
Abstract
No abstract availableKeywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time2010
- A note on the problem of reporting maximal cliquesTheoretical Computer Science, 2008
- Bounded Arboricity to Determine the Local Structure of Sparse GraphsLecture Notes in Computer Science, 2006
- The political blogosphere and the 2004 U.S. election2005
- Community structure in social and biological networksProceedings of the National Academy of Sciences, 2002
- Graph-Theoretic Techniques for Macromolecular DockingJournal of Chemical Information and Computer Sciences, 1999
- Planar orientations with low out-degree and compaction of adjacency matricesTheoretical Computer Science, 1991
- Arboricity and Subgraph Listing AlgorithmsSIAM Journal on Computing, 1985
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- An Analysis of Some Graph Theoretical Cluster TechniquesJournal of the ACM, 1970