Fetching the paper…
Reading the bibliography…
Graphlets are induced subgraphs of a large network and are important for understanding and modeling complex networks.
L. Zhang, M. Song, Z. Liu, X. Liu, J. Bu, and C. Chen, “Probabilistic graphlet cut: Exploiting spatial structure cue for weakly supervised image segmentation,” in CVPR , 2013, pp. 1908–1915
1915
Earlier work this paper cites.
M. Bādoiu, S. Har-Peled, and P. Indyk, “Approximate clustering via core-sets,” in STOC . ACM, 2002, pp. 250–257
2002
Earlier work this paper cites.
C. Noble and D. Cook, “Graph-based anomaly detection,” in SIGKDD , 2003, pp. 631–636
2003
Earlier work this paper cites.
N. Pržulj, D. G. Corneil, and I. Jurisica, “Modeling interactome: scale-free or geometric?” Bioinfo. , vol. 20, no. 18, pp. 3508–3515, 2004
2004
Earlier work this paper cites.
T. Wang, J. W. Touchman, W. Zhang, E. B. Suh, and G. Xue, “A parallel algorithm for extracting transcriptional regulatory network motifs,” in BIBE , 2005, pp. 193–200
2005
Earlier work this paper cites.
D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, “On unbiased sampling for unstructured peer-to-peer networks,” in SIGCOMM , 2006, pp. 27–40
2006
Earlier work this paper cites.
I. Bhattacharya and L. Getoor, “Entity resolution in graphs,” Mining graph data , p. 311, 2006
2006
Earlier work this paper cites.
S. Wernicke and F. Rasche, “Fanmod: a tool for fast network motif detection,” Bioinformatics , vol. 22, no. 9, pp. 1152–1153, 2006
2006
Earlier work this paper cites.
S. E. Schaeffer, “Graph clustering,” Comp. Sci. Rev. , vol. 1, no. 1, 2007
2007
Earlier work this paper cites.
L. Getoor and B. Taskar, Introduction to SRL . MIT press, 2007
2007
Earlier work this paper cites.
T. Milenkoviæ and N. Pržulj, “Uncovering biological network function via graphlet degree signatures,” Cancer info. , vol. 6, 2008
2008
Earlier work this paper cites.
N. Shervashidze, T. Petri, K. Mehlhorn, K. M. Borgwardt, and S. Vishwanathan, “Efficient graphlet kernels for large graph comparison,” in AISTATS , 2009
2009
Earlier work this paper cites.
C. E. Tsourakakis, U. Kang, G. L. Miller, and C. Faloutsos, “Doulion: counting triangles in massive graphs with a coin,” in SIGKDD , 2009
2009
Earlier work this paper cites.
S. V. N. Vishwanathan, N. N. Schraudolph, R. Kondor, and K. M. Borgwardt, “Graph kernels,” JMLR , vol. 11, pp. 1201–1242, 2010
2010
Earlier work this paper cites.
M. Rupp and G. Schneider, “Graph kernels for molecular similarity,” Molecular Informatics , vol. 29, no. 4, pp. 266–273, 2010
2010
Earlier work this paper cites.
S. Suri and S. Vassilvitskii, “Counting triangles and the curse of the last reducer,” in WWW , 2011, pp. 607–614
2011
Cited alongside, same era.
D. Boyd and K. Crawford, “Critical questions for big data: Provocations for a cultural, technological, and scholarly phenomenon,” Information, communication & society , vol. 15, no. 5, pp. 662–679, 2012
2012
Cited alongside, same era.
J. Pfeffer and K. M. Carley, “k-centralities: local approximations of global measures based on shortest paths,” in WWW , 2012
2012
Cited alongside, same era.
R. Pagh and C. E. Tsourakakis, “Colorful triangle counting and a mapreduce implementation,” IPL , vol. 112, no. 7, pp. 277–281, 2012
2012
Cited alongside, same era.
L. Roditty and U. Zwick, “Dynamic approximate all-pairs shortest paths in undirected graphs,” SICOMP , vol. 41, pp. 670–683, 2012
2012
M. Rahman, M. A. Bhuiyan, M. Rahman, and M. Al Hasan, “GUISE: a uniform sampler for constructing frequency histogram of graphlets,” KAIS , vol. 38, no. 3, pp. 511–536, 2014
2014
Later among the works it cites.
M. Rahman, M. Bhuiyan, M. Al Hasan et al. , “Graft: An efficient graphlet counting method for large graph analysis,” TKDE , vol. 26, no. 10, pp. 2466–2478, 2014
2014
Later among the works it cites.
T. Hočevar and J. Demšar, “A combinatorial approach to graphlet counting,” Bioinformatics , vol. 30, no. 4, pp. 559–565, 2014
2014
Later among the works it cites.
D. O. Aparício, P. M. P. Ribeiro, and F. M. A. da Silva, “Parallel subgraph counting for multicore architectures,” in ISPA , 2014, pp. 34–41
2014
Later among the works it cites.
A. Fischer, C. Y. Suen, V. Frinken, K. Riesen, and H. Bunke, “Approximation of graph edit distance based on hausdorff matching,” Pattern Recognition , vol. 48, no. 2, pp. 331–343, 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
D. Marcus and Y. Shavitt, “Rage–a rapid graphlet enumerator for large networks,” Computer Networks , vol. 56, no. 2, pp. 810–819, 2012
2012
Cited alongside, same era.
R. A. Rossi, L. K. McDowell, D. W. Aha, and J. Neville, “Transforming graph data for statistical relational learning,” JAIR , vol. 45, no. 1, pp. 363–441, 2012
2012
Cited alongside, same era.
P. Ribeiro, F. Silva, and L. Lopes, “Parallel discovery of network motifs,” JPDC , vol. 72, no. 2, pp. 144–154, 2012
2012
Cited alongside, same era.
W. Hayes, K. Sun, and N. Pržulj, “Graphlet-based measures are suitable for biological network comparison,” Bioinformatics , vol. 29, no. 4, pp. 483–491, 2013
2013
Cited alongside, same era.
2013
Cited alongside, same era.
M. Rahman and M. Al Hasan, “Approximate triangle counting algorithms on multi-cores,” in Big Data , 2013, pp. 127–133
2013
Cited alongside, same era.
N. N. Liu, L. He, and M. Zhao, “Social temporal collaborative ranking for context aware movie recommendation,” TIST , vol. 4, no. 1, p. 15, 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
Y. Lim and U. Kang, “Mascot: Memory-efficient and accurate sampling for counting local triangles in graph streams,” in SIGKDD , 2015
2015
Later among the works it cites.
R. A. Rossi, D. F. Gleich, and A. H. Gebremedhin, “Parallel maximum clique algorithms with applications to network analysis,” SISC , vol. 37, no. 5, p. 28, 2015
2015
Later among the works it cites.
R. Rossi and N. Ahmed, “Role discovery in networks,” TKDE , vol. 27, no. 4, pp. 1112–1131, 2015
2015
Later among the works it cites.
M. Jha, C. Seshadhri, and A. Pinar, “Path sampling: A fast and provable method for estimating 4-vertex subgraph counts,” in WWW , 2015
2015
Later among the works it cites.
N. K. Ahmed, J. Neville, R. A. Rossi, and N. Duffield, “Efficient graphlet counting for large networks,” in ICDM , 2015, p. 10
2015
Later among the works it cites.
R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in AAAI , 2015, pp. 4292–4293. [Online]. Available: {http://networkrepository.com}
2015
Later among the works it cites.
N. K. Ahmed and R. A. Rossi, “Interactive visual graph analytics on the web,” in ICWSM , 2015
2015
Later among the works it cites.
L. Zhang, R. Hong, Y. Gao, R. Ji, Q. Dai, and X. Li, “Image categorization by learning a propagated graphlet path,” TNNLS , vol. 27, no. 3, pp. 674–685, 2016
2016
Later among the works it cites.