Fetching the paper…
Reading the bibliography…
We implement a new algorithm for listing all maximal cliques in sparse graphs due to Eppstein, L\"offler, and Strash (ISAAC 2010) and analyze its performance on a large corpus of real-world graphs.
Harary, F., Ross, I.C.: A procedure for clique detection using the group matrix. Sociometry 20(3), 205–215 (1957)
1957
Earlier work this paper cites.
Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math. 3(1), 23–28 (1965)
1965
Earlier work this paper cites.
Augustson, J.G., Minker, J.: An analysis of some graph theoretical cluster techniques. J. ACM 17(4), 571–588 (1970)
1970
Earlier work this paper cites.
Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
1973
Earlier work this paper cites.
Kiss, G., Armstrong, C., Milroy, R., , Piper, J.: An associative thesaurus of English and its computer analysis. In: Aitken A.J., Bailey, R., Hamilton-Smith, N. (eds.) The Computer and Literary Studies. Edinburgh: University Press (1973)
1973
Earlier work this paper cites.
Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3), 505–517 (1977)
1977
Earlier work this paper cites.
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)
1977
Earlier work this paper cites.
Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210–223 (1985)
1985
Earlier work this paper cites.
Horaud, R., Skordas, T.: Stereo correspondence through feature grouping and maximal cliques. IEEE Trans. Patt. An. Mach. Int. 11(11), 1168–1180 (1989)
1989
Earlier work this paper cites.
Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2), 243 – 266 (1991)
1991
Earlier work this paper cites.
Grindley, H.M., Artymiuk, P.J., Rice, D.W., Willett, P.: Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J. Mol. Biol. 229(3), 707 – 721 (1993)
1993
Earlier work this paper cites.
Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading, MA (1993)
1993
Earlier work this paper cites.
Johnson, D.J., Trick, M.A. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993. American Mathematical Society, Boston, MA, USA (1996)
1996
Earlier work this paper cites.
Koch, I., Lengauer, T., Wanke, E.: An algorithm for finding maximal common subtopologies in a set of protein structures. J. Comput. Biol. 3(2), 289–306 (1996)
1996
Earlier work this paper cites.
Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proc. 3rd Int. Conf. Knowledge Discovery and Data Mining. pp. 283–286. AAAI Press (1997), http://www.aaai.org/Papers/KDD/1997/KDD97-060.pdf
1997
Earlier work this paper cites.
Samudrala, R., Moult, J.: A graph-theoretic algorithm for comparative modeling of protein structure. J. Mol. Biol. 279(1), 287 – 302 (1998)
1998
Cited alongside, same era.
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
1998
Cited alongside, same era.
Gardiner, E.J., Willett, P., Artymiuk, P.J.: Graph-theoretic techniques for macromolecular docking. J. Chem. Inf. Comput. Sci. 40(2), 273–279 (2000)
2000
Cited alongside, same era.
Hall, B.H., Jaffe, A.B., Trajtenberg, M.: The NBER patent citation data file: Lessons, insights and methodological tools. Tech. rep. (2001), NBER Working Paper 8498
2001
Cited alongside, same era.
Koch, I.: Enumerating all connected maximal common subgraphs in two graphs. Theor. Comput. Sci. 250(1-2), 1 – 30 (2001)
2001
Cited alongside, same era.
Makino, K., Uno, T.: New algorithms for enumerating all maximal cliques. In: Proc. 9th Scand. Worksh. Algorithm Theory. LNCS, vol. 3111, pp. 260–272. Springer-Verlag (2004)
2004
Later among the works it cites.
Adamic, L.A., Glance, N.: The political blogosphere and the 2004 us election. In: Proceedings of the WWW-2005 Workshop on the Weblogging Ecosystem (2005)
2005
Later among the works it cites.
Batagelj, V., Mrvar, A.: Pajek datasets (2006), http://vlado.fmf.uni-lj.si/pub/networks/data/
2006
Later among the works it cites.
Goel, G., Gustedt, J.: Bounded arboricity to determine the local structure of sparse graphs. In: Fomin, F. (ed.) WG 2006. LNCS, vol. 4271, pp. 159–167. Springer-Verlag (2006)
2006
Later among the works it cites.
Leicht, E.A., Holme, P., Newman, M.E.J.: Vertex similarity in networks. Phys. Rev. E 73 (2006)
2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. USA 98, 404–409 (2001)
2001
Cited alongside, same era.
Google programming contest (2002), http://www.google.com/programming-contest/
2002
Cited alongside, same era.
Corman, S.R., Kuhn, T., Mcphee, R.D., Dooley, K.J.: Studying complex discursive systems: Centering resonance analysis of communication. Human Communication Research 28(2), 157–206 (2002)
2002
Cited alongside, same era.
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)
2002
Cited alongside, same era.
Kdd cup (2003), http://www.cs.cornell.edu/projects/kddcup/index.html
2003
Cited alongside, same era.
Batagelj, V., Zaveršnik, M.: An O ( m ) O(m) algorithm for cores decomposition of networks (2003), http://arxiv.org/abs/cs.DS/0310049
2003
Cited alongside, same era.
Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54, 396–405 (2003)
2003
Cited alongside, same era.
Later among the works it cites.
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)
2006
Later among the works it cites.
Stark, C., Breitkreutz, B.J., Reguly, T., Boucher, L., Breitkreutz, A., Tyers, M.: BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 34, D535–D539 (2006)
2006
Later among the works it cites.
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28–42 (2006)
2006
Later among the works it cites.
Leskovec, J., Adamic, L., Adamic, B.: The dynamics of viral marketing. ACM Transactions on the Web 1(1) (2007)
2007
Later among the works it cites.
Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)
2007
Later among the works it cites.
Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1-3), 564 – 568 (2008)
2008
Later among the works it cites.
Leskovec, J., Lang, K.J., Dasgupta, A., Mahoney, M.W.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics 6(1), 29–123 (2009)
2009
Later among the works it cites.
Eppstein, D., Löffler, M., Strash, D.: Listing all maximal cliques in sparse graphs in near-optimal time. In: Cheong, O., Chwa, K.Y., Park, K. (eds.) ISAAC 2010, LNCS, vol. 6506, pp. 403–414. Springer-Verlag (2010)
2010
Later among the works it cites.
Leskovec, J., Huttenlocher, D., Kleinberg, J.: Predicting positive and negative links in online social networks. In: Proc. 19th Int. Conf. on World Wide Web. pp. 641–650. WWW ’10, ACM (2010)
2010
Later among the works it cites.