Fetching the paper…
Reading the bibliography…
Graph pattern mining applications try to find all embeddings that match specific patterns.
J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” in Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms , 1998, pp. 668–677
1998
Earlier work this paper cites.
D. R. Shaw, “The methods behind the madness: Presidential electoral college strategies, 1988-1996,” The Journal of Politics , vol. 61, no. 4, pp. 893–913, 1999
1999
Earlier work this paper cites.
M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design,” arXiv preprint cs/0209028 , 2002
2002
Earlier work this paper cites.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graphs over time: densification laws, shrinking diameters and possible explanations,” in Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining , 2005, pp. 177–187
2005
Earlier work this paper cites.
L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining , 2006, pp. 44–54
2006
Earlier work this paper cites.
L. Ceze, J. Tuck, J. Torrellas, and C. Cascaval, “Bulk disambiguation of speculative threads in multiprocessors,” ACM SIGARCH Computer Architecture News , vol. 34, no. 2, pp. 227–238, 2006
2006
Earlier work this paper cites.
A. N. Langville and C. D. Meyer, “A reordering for the pagerank problem,” SIAM Journal on Scientific Computing , vol. 27, no. 6, pp. 2112–2120, 2006
2006
Earlier work this paper cites.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: Densification and shrinking diameters,” ACM transactions on Knowledge Discovery from Data (TKDD) , vol. 1, no. 1, pp. 2–es, 2007
2007
Earlier work this paper cites.
J. Leskovec, J. Kleinberg, and C. Faloutsos, “Graph evolution: Densification and shrinking diameters,” ACM transactions on Knowledge Discovery from Data (TKDD) , vol. 1, no. 1, pp. 2–es, 2007
2007
Earlier work this paper cites.
B. Bringmann and S. Nijssen, “What is frequent in a single graph?” in Pacific-Asia Conference on Knowledge Discovery and Data Mining . Springer, 2008, pp. 858–863
2008
Earlier work this paper cites.
R. Geisberger, P. Sanders, and D. Schultes, “Better approximation of betweenness centrality,” in 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) . SIAM, 2008, pp. 90–100
2008
Earlier work this paper cites.
Intel, Intel 64 and IA-32 Architectures Optimization Reference Manual , December 2008. [Online]. Available: http://developer.intel.com/products/processor/manuals/
2008
Earlier work this paper cites.
A. Buluç, J. T. Fineman, M. Frigo, J. R. Gilbert, and C. E. Leiserson, “Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks,” in Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures , 2009, pp. 233–244
2009
Earlier work this paper cites.
U. Kang, C. E. Tsourakakis, and C. Faloutsos, “Pegasus: A peta-scale graph mining system implementation and observations,” in 2009 Ninth IEEE International Conference on Data Mining . IEEE, 2009, pp. 229–238
2009
Earlier work this paper cites.
J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, “Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters,” Internet Mathematics , vol. 6, no. 1, pp. 29–123, 2009
2009
Earlier work this paper cites.
N. Muralimanohar, R. Balasubramonian, and N. Jouppi, “Cacti 6.0: A tool to model large caches,” HP Laboratories , 01 2009
2009
Earlier work this paper cites.
J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Predicting positive and negative links in online social networks,” in Proceedings of the 19th international conference on World wide web , 2010, pp. 641–650
2010
Earlier work this paper cites.
J. Leskovec, D. Huttenlocher, and J. Kleinberg, “Signed networks in social media,” in Proceedings of the SIGCHI conference on human factors in computing systems , 2010, pp. 1361–1370
2010
Earlier work this paper cites.
G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski, “Pregel: a system for large-scale graph processing,” in Proceedings of the 2010 ACM SIGMOD International Conference on Management of data , 2010, pp. 135–146
2010
Earlier work this paper cites.
T. A. Davis and Y. Hu, “The university of florida sparse matrix collection,” ACM Transactions on Mathematical Software (TOMS) , vol. 38, no. 1, pp. 1–25, 2011
2011
Earlier work this paper cites.
J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin, “Powergraph: Distributed graph-parallel computation on natural graphs,” in Presented as part of the 10th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 12) , 2012, pp. 17–30
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
D. A. Bader, H. Meyerhenke, P. Sanders, and D. Wagner, Graph partitioning and graph clustering . American Mathematical Society Providence, RI, 2013, vol. 588
2013
Earlier work this paper cites.
J. Kunegis, “Konect: The koblenz network collection,” in Proceedings of the 22nd International Conference on World Wide Web , ser. WWW ’13 Companion. New York, NY, USA: Association for Computing Machinery, 2013, p. 1343–1350. [Online]. Available: https://doi.org/10.1145/2487788.2488173
2013
Cited alongside, same era.
T. Mattson, D. Bader, J. Berry, A. Buluc, J. Dongarra, C. Faloutsos, J. Feo, J. Gilbert, J. Gonzalez, B. Hendrickson et al. , “Standards for graph algorithm primitives,” in 2013 IEEE High Performance Extreme Computing Conference (HPEC) . IEEE, 2013, pp. 1–2
2013
Cited alongside, same era.
D. Nguyen, A. Lenharth, and K. Pingali, “A lightweight infrastructure for graph analytics,” in Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles , 2013, pp. 456–471
2013
Cited alongside, same era.
D. Sanchez and C. Kozyrakis, “Zsim: Fast and accurate microarchitectural simulation of thousand-core systems,” in Proceedings of the 40th Annual International Symposium on Computer Architecture , ser. ISCA ’13. New York, NY, USA: ACM, 2013, pp. 475–486. [Online]. Available: http://doi.acm.org/10.1145/2485922.2485963
R. Dathathri, G. Gill, L. Hoang, H.-V. Dang, A. Brooks, N. Dryden, M. Snir, and K. Pingali, “Gluon: A communication-optimizing substrate for distributed heterogeneous graph analytics,” in Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation , 2018, pp. 752–768
2018
Later among the works it cites.
L. Song, Y. Zhuo, X. Qian, H. Li, and Y. Chen, “Graphr: Accelerating graph processing using reram,” in 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA) . IEEE, 2018, pp. 531–543
2018
Later among the works it cites.
K. Wang, Z. Zuo, J. Thorpe, T. Q. Nguyen, and G. H. Xu, “Rstream: marrying relational algebra with streaming for efficient graph mining on a single machine,” in 13th { \{ USENIX } \} Symposium on Operating Systems Design and Implementation ( { \{ OSDI } \} 18) , 2018, pp. 763–782
2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
J. Shun and G. E. Blelloch, “Ligra: a lightweight graph processing framework for shared memory,” in Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming , 2013, pp. 135–146
2013
Cited alongside, same era.
S. Uddin, L. Hossain et al. , “Dyad and triad census analysis of crisis communication network,” Social Networking , vol. 2, no. 01, p. 32, 2013
2013
Cited alongside, same era.
A. Duma and A. Topirceanu, “A network motif based approach for classifying online social networks,” in 2014 IEEE 9th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI) . IEEE, 2014, pp. 311–315
2014
Cited alongside, same era.
M. Elseidy, E. Abdelhamid, S. Skiadopoulos, and P. Kalnis, “Grami: Frequent subgraph and pattern mining in a single large graph,” Proceedings of the VLDB Endowment , vol. 7, no. 7, pp. 517–528, 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
X. Qian, B. Sahelices, and J. Torrellas, “Omniorder: Directory-based conflict serialization of transactions,” ACM SIGARCH Computer Architecture News , vol. 42, no. 3, pp. 421–432, 2014
2014
Cited alongside, same era.
J. Ahn, S. Hong, S. Yoo, O. Mutlu, and K. Choi, “A scalable processing-in-memory accelerator for parallel graph processing,” in Proceedings of the 42nd Annual International Symposium on Computer Architecture , 2015, pp. 105–117
2015
Cited alongside, same era.
R. A. Rossi and N. K. Ahmed, “The network data repository with interactive graph analytics and visualization,” in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence , 2015. [Online]. Available: http://networkrepository.com
2015
Cited alongside, same era.
2018
Later among the works it cites.
2019
Later among the works it cites.
V. Dadu, J. Weng, S. Liu, and T. Nowatzki, “Towards general purpose acceleration by exploiting common data-dependence forms,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 924–939
2019
Later among the works it cites.
V. Dias, C. H. Teixeira, D. Guedes, W. Meira, and S. Parthasarathy, “Fractal: A general-purpose graph pattern mining system,” in Proceedings of the 2019 International Conference on Management of Data , 2019, pp. 1357–1374
2019
Later among the works it cites.
A. Gondimalla, N. Chesnut, M. Thottethodi, and T. Vijaykumar, “Sparten: A sparse tensor accelerator for convolutional neural networks,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 151–165
2019
Later among the works it cites.
K. Hegde, H. Asghari-Moghaddam, M. Pellauer, N. Crago, A. Jaleel, E. Solomonik, J. Emer, and C. W. Fletcher, “Extensor: An accelerator for sparse tensor algebra,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 319–333
2019
Later among the works it cites.
2019
Later among the works it cites.
D. Mawhirter and B. Wu, “Automine: harmonizing high-level abstraction and high performance for graph mining,” in Proceedings of the 27th ACM Symposium on Operating Systems Principles , 2019, pp. 509–523
2019
Later among the works it cites.
2019
Later among the works it cites.
Z. Wang and T. Nowatzki, “Stream-based memory access specialization for general purpose processors,” in 2019 ACM/IEEE 46th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2019, pp. 736–749
2019
Later among the works it cites.
Y. Zhuo, C. Wang, M. Zhang, R. Wang, D. Niu, Y. Wang, and X. Qian, “Graphq: Scalable pim-based graph processing,” in Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture , 2019, pp. 712–725
2019
Later among the works it cites.
2020
Closest in time.
V. Gleyzer, A. J. Soszynski, and E. K. Kao, “Leveraging linear algebra to count and enumerate simple subgraphs,” in 2020 IEEE High Performance Extreme Computing Conference (HPEC) . IEEE, 2020, pp. 1–8
2020
Closest in time.
K. Jamshidi, R. Mahadasa, and K. Vora, “Peregrine: a pattern-aware graph mining system,” in Proceedings of the Fifteenth European Conference on Computer Systems , 2020, pp. 1–16
2020
Closest in time.
S. Rahman, N. Abu-Ghazaleh, and R. Gupta, “Graphpulse: An event-driven hardware accelerator for asynchronous graph processing,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2020, pp. 908–921
2020
Closest in time.
T. Shi, M. Zhai, Y. Xu, and J. Zhai, “Graphpi: High performance graph pattern matching through effective redundancy elimination,” in 2020 SC20: International Conference for High Performance Computing, Networking, Storage and Analysis (SC) . IEEE Computer Society, pp. 1418–1431
2020
Closest in time.
Y. Yang, Z. Li, Y. Deng, Z. Liu, S. Yin, S. Wei, and L. Liu, “Graphabcd: Scaling out graph analytics with asynchronous block coordinate descent,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) , May 2020, pp. 419–432
2020
Closest in time.
Y. Yang, Z. Li, Y. Deng, Z. Liu, S. Yin, S. Wei, and L. Liu, “Graphabcd: Scaling out graph analytics with asynchronous block coordinate descent,” in 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 2020, pp. 419–432
2020
Closest in time.
P. Yao, L. Zheng, Z. Zeng, Y. Huang, C. Gui, X. Liao, H. Jin, and J. Xue, “A locality-aware energy-efficient accelerator for graph mining applications,” in 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 2020, pp. 895–907
2020
Closest in time.