Author:
Viard Tiphaine,Latapy Matthieu,Magnien Clémence
Funder
DGA
Thales
Agence Nationale de la Recherche
PIA
Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. Algorithm 457: finding all cliques of an undirected graph;Bron;Commun. ACM,1973
2. Time-varying graphs and dynamic networks;Casteigts,2011
3. A note on the problem of reporting maximal cliques;Cazals;Theoret. Comput. Sci.,2008
4. Listing all maximal cliques in large sparse real-world graphs;Eppstein;ACM J. Exp. Algorithmics,2013
5. Contact patterns among high school students;Fournet;PLoS ONE,2014
Cited by
89 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献