Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
- 31 July 2017
- journal article
- research article
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 7 (1) , 1-16
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (NI 369/12)
This publication has 24 references indexed in Scilit:
- On Temporal Graph Exploration2015
- Mitigation of infectious disease at school: targeted class closure vs school closureBMC Infectious Diseases, 2014
- The structure and dynamics of multilayer networksPhysics Reports, 2014
- Contact Patterns among High School StudentsPLOS ONE, 2014
- Temporal networksPhysics Reports, 2012
- What's in a crowd? Analysis of face-to-face behavioral networksJournal of Theoretical Biology, 2011
- Isolation concepts for clique enumeration: Comparison and computational experimentsTheoretical Computer Science, 2009
- Periodic subgraph mining in dynamic networksKnowledge and Information Systems, 2009
- Isolation concepts for efficiently enumerating dense subgraphsTheoretical Computer Science, 2009
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973