Fetching the paper…
Reading the bibliography…
We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges.
On the evolution of random graphs
P. Erds and A. Rényi · 1960
Earlier work this paper cites.
On cliques in graphs
J. W. Moon and L. Moser · 1965
Earlier work this paper cites.
Algorithm 457: finding all cliques of an undirected graph
C. Bron and J. Kerbosch · 1973
Earlier work this paper cites.
A new algorithm for generating all the maximal independent sets
S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa · 1977
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
N. Chiba and T. Nishizeki · 1985
Earlier work this paper cites.
On generating all maximal independent sets
D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou · 1988
Earlier work this paper cites.
Reverse search for enumeration
D. Avis and K. Fukuda · 1993
Earlier work this paper cites.
Trawling the web for emerging cyber-communities
R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins · 1999
Earlier work this paper cites.
Decremental dynamic connectivity
M. Thorup · 1999
Earlier work this paper cites.
Enumerating all connected maximal common subgraphs in two graphs
I. Koch · 2001
Earlier work this paper cites.
Visualizing plant metabolomic correlation networks using clique-metabolite matrices
F. Kose, W. Weckwerth, T. Linke, and O. Fiehn · 2001
Earlier work this paper cites.
Obtaining maximal concatenated phylogenetic data sets from large sequence databases
M. J. Sanderson, A. C. Driskell, R. H. Ree, O. Eulenstein, and S. Langley · 2003
Earlier work this paper cites.
Prospects for building the tree of life from large sequence databases
A. C. Driskell, C. An�, J. G. Burleigh, M. M. McMahon, B. C. O’Meara, and M. J. Sanderson · 2004
Earlier work this paper cites.
New algorithms for enumerating all maximal cliques
K. Makino and T. Uno · 2004
Earlier work this paper cites.
Finding all maximal cliques in dynamic graphs
V. Stix · 2004
Earlier work this paper cites.
Discovering large dense subgraphs in massive graphs
D. Gibson, R. Kumar, and A. Tomkins · 2005
Cited alongside, same era.
Towards a formal concept analysis approach to exploring communities on the world wide web
J. E. Rome and R. M. Haralick · 2005
Cited alongside, same era.
Identifying optimal incomplete phylogenetic data sets from sequence databases
C. Yan, J. G. Burleigh, and O. Eulenstein · 2005
Cited alongside, same era.
The worst-case time complexity for generating all maximal cliques and computational experiments
E. Tomita, A. Tanaka, and H. Takahashi · 2006
Cited alongside, same era.
Why we twitter: An analysis of a microblogging community
A. Java, X. Song, T. Finin, and B. L. Tseng · 2007
Cited alongside, same era.
Biclique communities
S. Lehmann, M. Schwartz, and L. K. Hansen · 2008
Cited alongside, same era.
Dense subgraph maintenance under streaming edge weight updates for real-time story identification
A. Angel, N. Koudas, N. Sarkas, D. Srivastava, M. Svendsen, and S. Tirthapura · 2013
Later among the works it cites.
Streaming algorithms for k-core decomposition
A. E. Sariyüce, B. Gedik, G. Jacques-Silva, K. Wu, and Ü. V. Çatalyürek · 2013
Later among the works it cites.
Faster deterministic fully-dynamic graph connectivity
C. Wulff-Nilsen · 2013
Later among the works it cites.
Querying k-truss community in large and dynamic graphs
X. Huang, H. Cheng, L. Qin, W. Tian, and J. X. Yu · 2014
Later among the works it cites.
SNAP Datasets: Stanford large network dataset collection
J. Leskovec and A. Krevl · 2014
Later among the works it cites.
Efficient core maintenance in large dynamic graphs
R. Li, J. X. Yu, and R. Mao · 2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Listing all maximal cliques in sparse graphs in near-optimal time
D. Eppstein, M. Löffler, and D. Strash · 2010
Cited alongside, same era.
Honour thy neighbour: clique maintenance in dynamic graphs
T. J. Ottosen and J. Vomlel · 2010
Cited alongside, same era.
Approximate common intervals in multiple genome comparison
A. Chateau, P. Riou, and E. Rivals · 2011
Cited alongside, same era.
Finding maximal cliques in massive networks
J. Cheng, Y. Ke, A. W.-C. Fu, J. X. Yu, and L. Zhu · 2011
Cited alongside, same era.
Listing all maximal cliques in large sparse real-world graphs
D. Eppstein and D. Strash · 2011
Cited alongside, same era.
Mining direct antagonistic communities in explicit trust networks
D. Lo, D. Surian, K. Zhang, and E.-P. Lim · 2011
Cited alongside, same era.
Co-maxrs: Continuous maximizing range-sum query
M. M.-u. Hussain, A. Wang, and G. Trajcevski · 2015
Later among the works it cites.
Densest subgraph in dynamic graph streams
A. McGregor, D. Tench, S. Vorotnikova, and H. T. Vu · 2015
Later among the works it cites.
Mining maximal cliques from a large graph using mapreduce: Tackling highly uneven subproblem sizes
M. Svendsen, A. P. Mukherjee, and S. Tirthapura · 2015
Later among the works it cites.
Work-efficient parallel union-find with applications to incremental graph connectivity
N. Simsiri, K. Tangwongsan, S. Tirthapura, and K.-L. Wu · 2016
Closest in time.
A change-sensitive algorithm for maintaining maximal bicliques in a dynamic bipartite graph
A. Das and S. Tirthapura · 2017
Closest in time.
Enumerating maximal bicliques from a large graph using mapreduce
A. P. Mukherjee and S. Tirthapura · 2017
Closest in time.
Enumeration of maximal cliques from an uncertain graph
A. P. Mukherjee, P. Xu, and S. Tirthapura · 2017
Closest in time.
Mining maximal cliques on dynamic graphs efficiently by local strategies
S. Sun, Y. Wang, W. Liao, and W. Wang · 2017
Closest in time.