Fetching the paper…
Reading the bibliography…
Graph mining for structural patterns is a fundamental task in many applications.
Kaleido: An Efficient Out-of-core Graph Mining System on A Single Machine
Cheng Zhao, Zhibin Zhang, Peng Xu, Tianqi Zheng, and Xueqi Cheng. 2019 · 1905
Earlier work this paper cites.
Multilevelk-way partitioning scheme for irregular graphs
George Karypis and Vipin Kumar. 1998 · 1998
Earlier work this paper cites.
gSpan: Graph-Based Substructure Pattern Mining. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9-12 December 2002, Maebashi City, Japan . 721–724
Xifeng Yan and Jiawei Han. 2002 · 2002
Earlier work this paper cites.
The structure and function of complex networks
M. E. J. Newman. 2003 · 2003
Earlier work this paper cites.
The WebGraph Framework I: Compression Techniques. In Proc. of the Thirteenth International World Wide Web Conference (WWW 2004) . ACM Press, Manhattan, USA, 595–601
Paolo Boldi and Sebastiano Vigna. 2004 · 2004
Earlier work this paper cites.
Graphs over time: densification laws, shrinking diameters and possible explanations. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Chicago, Illinois, USA, August 21-24, 2005 . 177–187
Jure Leskovec, Jon M. Kleinberg, and Christos Faloutsos. 2005 · 2005
Earlier work this paper cites.
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 (KDD ’06) . ACM, New York, NY, USA, 44–54
Lars Backstrom, Dan Huttenlocher, Jon Kleinberg, and Xiangyang Lan. 2006 · 2006
Earlier work this paper cites.
FANMOD: A Tool for Fast Network Motif Detection
Sebastian Wernicke and Florian Rasche. 2006 · 2006
Earlier work this paper cites.
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy. 2008 · 2008
Earlier work this paper cites.
What is Twitter, a social network or a news media?. In Proceedings of the 19th international conference on World wide web . AcM, 591–600
Haewoon Kwak, Changhyun Lee, Hosung Park, and Sue Moon. 2010 · 2010
Earlier work this paper cites.
Predicting positive and negative links in online social networks. In Proceedings of the 19th international conference on World wide web . ACM, 641–650
Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010 · 2010
Earlier work this paper cites.
Pregel: A System for Large-scale Graph Processing. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data (SIGMOD ’10) . 135–146
Grzegorz Malewicz, Matthew H. Austern, Aart J.C Bik, James C. Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010 · 2010
Earlier work this paper cites.
Layered Label Propagation: A MultiResolution Coordinate-Free Ordering for Compressing Social Networks. In Proceedings of the 20th international conference on World Wide Web , Sadagopan Srinivasan, Krithi Ramamritham, Arun Kumar, M. P. Ravindra, Elisa Bertino, and Ravi Kumar (Eds.). ACM Press, 587–596
Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. 2011 · 2011
Earlier work this paper cites.
Triangle Listing in Massive Networks
Shumo Chu and James Cheng. 2012 · 2012
Earlier work this paper cites.
Green-Marl: a DSL for easy and efficient graph analysis
Sungpack Hong, Hassan Chafi, Edic Sedlar, and Kunle Olukotun. 2012 · 2012
Earlier work this paper cites.
GraphChi: Large-scale Graph Computation on Just a PC. In Proceedings of the 10th USENIX Conference on Operating Systems Design and Implementation (OSDI’12) . 31–46
Aapo Kyrola, Guy Blelloch, and Carlos Guestrin. 2012 · 2012
Earlier work this paper cites.
Distributed GraphLab: A Framework for Machine Learning in the Cloud
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny Bickson, Carlos Guestrin, and Joseph M. Hellerstein. 2012 · 2012
Earlier work this paper cites.
X-Stream: Edge-centric Graph Processing Using Streaming Partitions. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles (SOSP ’13) . 472–488
Amitabha Roy, Ivo Mihailovic, and Willy Zwaenepoel. 2013 · 2013
Earlier work this paper cites.
SociaLite: Datalog extensions for efficient social network analysis. In 2013 IEEE 29th International Conference on Data Engineering (ICDE) . IEEE, 278–289
Jiwon Seo, Stephen Guo, and Monica S Lam. 2013 · 2013
Cited alongside, same era.
Ligra: A Lightweight Graph Processing Framework for Shared Memory. In Proceedings of the 18th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP ’13) . 135–146
Julian Shun and Guy E. Blelloch. 2013 · 2013
Cited alongside, same era.
Graph-based Anomaly Detection and Description: A Survey
Leman Akoglu, Hanghang Tong, and Danai Koutra. 2014 · 2014
Cited alongside, same era.
GRAMI: Frequent Subgraph and Pattern Mining in a Single Large Graph
Mohammed Elseidy, Ehab Abdelhamid, Spiros Skiadopoulos, and Panos Kalnis. 2014 · 2014
Cited alongside, same era.
A combinatorial approach to graphlet counting
Tomaz Hocevar and Janez Demsar. 2014 · 2014
Emptyheaded: A relational engine for graph processing
Christopher R Aberger, Andrew Lamb, Susan Tu, Andres Nötzli, Kunle Olukotun, and Christopher Ré. 2017 · 2017
Later among the works it cites.
Graphflow: An active graph database. In Proceedings of the 2017 ACM International Conference on Management of Data . ACM, 1695–1698
Chathura Kankanamge, Siddhartha Sahu, Amine Mhedbhi, Jeremy Chen, and Semih Salihoglu. 2017 · 2017
Later among the works it cites.
Parallel triangle counting and k-truss identification using graph-centric methods. In 2017 IEEE High Performance Extreme Computing Conference, HPEC 2017, Waltham, MA, USA, September 12-14, 2017 . 1–7
Chad Voegele, Yi-Shan Lu, Sreepathi Pai, and Keshav Pingali. 2017 · 2017
Later among the works it cites.
G-Miner: an efficient task-oriented graph mining system. In Proceedings of the Thirteenth EuroSys Conference, EuroSys 2018, Porto, Portugal, April 23-26, 2018 . 32:1–32:12
Hongzhi Chen, Miao Liu, Yunjian Zhao, Xiao Yan, Da Yan, and James Cheng. 2018 · 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…
Cited alongside, same era.
Efficient Graphlet Counting for Large Networks. In 2015 IEEE International Conference on Data Mining, ICDM 2015, Atlantic City, NJ, USA, November 14-17, 2015 . 1–10
Nesreen K. Ahmed, Jennifer Neville, Ryan A. Rossi, and Nick G. Duffield. 2015 · 2015
Cited alongside, same era.
A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs. In Proceedings of the 18th International Conference on Extending Database Technology, EDBT 2015, Brussels, Belgium, March 23-27, 2015 . 157–168
Sutanay Choudhury, Lawrence B. Holder, George Chin Jr., Khushbu Agarwal, and John Feo. 2015 · 2015
Cited alongside, same era.
Multicore triangle computations without tuning. In 31st IEEE International Conference on Data Engineering, ICDE 2015, Seoul, South Korea, April 13-17, 2015 . 149–160
Julian Shun and Kanat Tangwongsan. 2015 · 2015
Cited alongside, same era.
Arabesque: a system for distributed graph mining. In Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015, Monterey, CA, USA, October 4-7, 2015 . 425–440
Carlos H. C. Teixeira, Alexandre J. Fonseca, Marco Serafini, Georgos Siganos, Mohammed J. Zaki, and Ashraf Aboulnaga. 2015 · 2015
Cited alongside, same era.
Xiaowei Zhu, Wentao Han, and Wenguang Chen. 2015 · 2015
Cited alongside, same era.
Scalemine: scalable parallel frequent subgraph mining in a single large graph. In Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2016, Salt Lake City, UT, USA, November 13-18, 2016 . 716–727
Ehab Abdelhamid, Ibrahim Abdelaziz, Panos Kalnis, Zuhair Khayyat, and Fuad Jamour. 2016 · 2016
Cited alongside, same era.
Efficient Processing of Large Graphs via Input Reduction. In Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing, HPDC 2016, Kyoto, Japan, May 31 - June 04, 2016 . 245–257
Amlan Kusum, Keval Vora, Rajiv Gupta, and Iulian Neamtiu. 2016 · 2016
Cited alongside, same era.
Gurbinder Gill, Roshan Dathathri, Loc Hoang, and Keshav Pingali. 2018a · 2018
Later among the works it cites.
TriCore: parallel triangle counting on GPUs. In Proceedings of the International Conference for High Performance Computing, Networking, Storage, and Analysis, SC 2018, Dallas, TX, USA, November 11-16, 2018 . 14:1–14:12
Yang Hu, Hang Liu, and H. Howie Huang. 2018 · 2018
Later among the works it cites.
ASAP: Fast, Approximate Graph Pattern Mining at Scale. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18) . USENIX Association, Carlsbad, CA, 745–761
Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018 · 2018
Later among the works it cites.
ApproxG: Fast Approximate Parallel Graphlet Counting Through Accuracy Control. In 18th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing, CCGRID 2018, Washington, DC, USA, May 1-4, 2018 . 533–542
Daniel Mawhirter, Bo Wu, Dinesh Mehta, and Chao Ai. 2018 · 2018
Later among the works it cites.
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 2018, Carlsbad, CA, USA, October 8-10, 2018. 763–782
Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 2018 · 2018
Later among the works it cites.
Node, Motif and Subgraph: Leveraging Network Functional Blocks Through Structural Convolution. In IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, ASONAM 2018, Barcelona, Spain, August 28-31, 2018 . 47–52
Carl Yang, Mengxiong Liu, Vincent W. Zheng, and Jiawei Han. 2018 · 2018
Later among the works it cites.
Wonderland: A Novel Abstraction-Based Out-Of-Core Graph Processing System. In Proceedings of the Twenty-Third International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2018, Williamsburg, VA, USA, March 24-28, 2018 . 608–621
Mingxing Zhang, Yongwei Wu, Youwei Zhuo, Xuehai Qian, Chengying Huan, and Kang Chen. 2018a · 2018
Later among the works it cites.
GraphIt: a high-performance graph DSL
Yunming Zhang, Mengjiao Yang, Riyadh Baghdadi, Shoaib Kamil, Julian Shun, and Saman P. Amarasinghe. 2018b · 2018
Later among the works it cites.
Fast Rectangle Counting on Massive Networks. In IEEE International Conference on Data Mining, ICDM 2018, Singapore, November 17-20, 2018 . 847–856
Rong Zhu, Zhaonian Zou, and Jianzhong Li. 2018 · 2018
Later among the works it cites.
graphchallenge
2019 · 2019
Closest in time.
Orkut social network
2019 · 2019
Closest in time.
Fractal: A General-Purpose Graph Pattern Mining System. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019 . 1357–1374
Vinícius Vitor dos Santos Dias, Carlos H. C. Teixeira, Dorgival O. Guedes, Wagner Meira Jr., and Srinivasan Parthasarathy. 2019 · 2019
Closest in time.
AutoMine: harmonizing high-level abstraction and high performance for graph mining. In Proceedings of the 27th ACM Symposium on Operating Systems Principles . ACM, 509–523
Daniel Mawhirter and Bo Wu. 2019 · 2019
Closest in time.