Fetching the paper…
Reading the bibliography…
We propose GraphMineSuite (GMS): the first benchmarking suite for graph mining that facilitates evaluating and constructing high-performance graph mining algorithms.
O jistém problému minimálním
O. Boruvka · 1926
Earlier work this paper cites.
On a routing problem
R. Bellman · 1958
Earlier work this paper cites.
On cliques in graphs
J. W. Moon and L. Moser · 1965
Earlier work this paper cites.
Algorithm 457: finding all cliques of an undirected graph
C. Bron and J. Kerbosch · 1973
Earlier work this paper cites.
Clustering using a similarity measure based on shared near neighbors
R. A. Jarvis and E. A. Patrick · 1973
Earlier work this paper cites.
On the evolution of random graphs
P. Erdős and A. Rényi · 1976
Earlier work this paper cites.
An algorithm for subgraph isomorphism
J. R. Ullmann · 1976
Earlier work this paper cites.
A new algorithm for generating all the maximal independent sets
S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa · 1977
Earlier work this paper cites.
Smallest-last ordering and clustering and graph coloring algorithms
D. W. Matula and L. L. Beck · 1983
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
N. Chiba and T. Nishizeki · 1985
Earlier work this paper cites.
Robin hood hashing
P. Celis · 1986
Earlier work this paper cites.
On generating all maximal independent sets
D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou · 1988
Earlier work this paper cites.
Planar orientations with low out-degree and compaction of adjacency matrices
M. Chrobak and D. Eppstein · 1991
Earlier work this paper cites.
A parallel graph coloring heuristic
M. T. Jones and P. E. Plassmann · 1993
Earlier work this paper cites.
Edge-coloring and f-coloring for various classes of graphs
X. Zhou and T. Nishizeki · 1994
Earlier work this paper cites.
A new approach to the minimum cut problem
D. R. Karger and C. Stein · 1996
Earlier work this paper cites.
Combinatorial optimization: algorithms and complexity
C. H. Papadimitriou and K. Steiglitz · 1998
Earlier work this paper cites.
Emergence of scaling in random networks
A.-L. Barabási and R. Albert · 1999
Earlier work this paper cites.
Simple distributed δ \delta + 1-coloring of graphs
Ö. Johansson · 1999
Earlier work this paper cites.
Papi: A portable interface to hardware performance counters
P. J. Mucci, S. Browne, C. Deane, and G. Ho · 1999
Earlier work this paper cites.
The pagerank citation ranking: Bringing order to the web
L. Page, S. Brin, R. Motwani, and T. Winograd · 1999
Earlier work this paper cites.
A faster algorithm for betweenness centrality
U. Brandes · 2001
Earlier work this paper cites.
Enumerating all connected maximal common subgraphs in two graphs
I. Koch · 2001
Earlier work this paper cites.
Visualizing plant metabolomic correlation networks using clique–metabolite matrices
F. Kose, W. Weckwerth, T. Linke, and O. Fiehn · 2001
Earlier work this paper cites.
Compact representations of separable graphs
D. K. Blandford, G. E. Blelloch, and I. A. Kash · 2003
Earlier work this paper cites.
Δ \Delta -stepping: a parallelizable shortest path algorithm
U. Meyer and P. Sanders · 2003
Earlier work this paper cites.
State of the art of graph-based data mining
T. Washio and H. Motoda · 2003
Earlier work this paper cites.
The WebGraph framework I: Compression techniques
P. Boldi and S. Vigna · 2004
Earlier work this paper cites.
The webgraph framework i: compression techniques
P. Boldi and S. Vigna · 2004
Earlier work this paper cites.
A (sub) graph isomorphism algorithm for matching large graphs
L. P. Cordella et al · 2004
Earlier work this paper cites.
Cyclic pattern kernels for predictive graph mining
T. Horváth et al · 2004
Earlier work this paper cites.
New algorithms for enumerating all maximal cliques
K. Makino and T. Uno · 2004
Earlier work this paper cites.
Finding all maximal cliques in dynamic graphs
V. Stix · 2004
Earlier work this paper cites.
Link prediction in relational data
B. Taskar et al · 2004
Earlier work this paper cites.
Design and implementation of the hpcs graph analysis benchmark on symmetric multiprocessors
D. A. Bader and K. Madduri · 2005
Earlier work this paper cites.
A scalable parallel graph coloring algorithm for distributed memory computers
E. G. Boman et al · 2005
Earlier work this paper cites.
The parallel bgl: A generic library for distributed graph computations
D. Gregor and A. Lumsdaine · 2005
Earlier work this paper cites.
Genome-scale computational approaches to memory-intensive applications in systems biology
Y. Zhang, F. N. Abu-Khzam, N. E. Baldwin, E. J. Chesler, M. A. Langston, and N. F. Samatova · 2005
Earlier work this paper cites.
Link prediction using supervised learning
M. Al Hasan et al · 2006
Earlier work this paper cites.
A survey of clustering data mining techniques
P. Berkhin · 2006
Earlier work this paper cites.
Graph mining: Laws, generators, and algorithms
D. Chakrabarti and C. Faloutsos · 2006
Earlier work this paper cites.
Mining graph data
D. J. Cook and L. B. Holder · 2006
Earlier work this paper cites.
The igraph software package for complex network research
G. Csardi and T. Nepusz · 2006
Earlier work this paper cites.
A parallel algorithm for enumerating all maximal cliques in complex network
N. Du, B. Wu, L. Xu, B. Wang, and X. Pei · 2006
Earlier work this paper cites.
Matching structure and semantics: A survey on graph-based pattern matching
B. Gallagher · 2006
Earlier work this paper cites.
Vertex similarity in networks
E. A. Leicht et al · 2006
Earlier work this paper cites.
The worst-case time complexity for generating all maximal cliques and computational experiments
E. Tomita, A. Tanaka, and H. Takahashi · 2006
Earlier work this paper cites.
The link-prediction problem for social networks
D. Liben-Nowell and J. Kleinberg · 2007
Earlier work this paper cites.
Challenges in Parallel Graph Processing
A. Lumsdaine, D. Gregor, B. Hendrickson, and J. W. Berry · 2007
Earlier work this paper cites.
Near linear time algorithm to detect community structures in large-scale networks
U. N. Raghavan, R. Albert, and S. Kumara · 2007
Earlier work this paper cites.
Graph clustering
S. E. Schaeffer · 2007
Earlier work this paper cites.
Algorithmic aspects of triangle-based network analysis
T. Schank · 2007
Earlier work this paper cites.
Fast unfolding of communities in large networks
V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre · 2008
Earlier work this paper cites.
A note on the problem of reporting maximal cliques
F. Cazals and C. Karande · 2008
Earlier work this paper cites.
A view of the parallel computing landscape
K. Asanovic et al · 2009
Earlier work this paper cites.
k 2-trees for compact web graph representation
N. R. Brisaboa, S. Ladra, and G. Navarro · 2009
Earlier work this paper cites.
Rodinia: A benchmark suite for heterogeneous computing
S. Che, M. Boyer, J. Meng, D. Tarjan, J. W. Sheaffer, S.-H. Lee, and K. Skadron · 2009
Earlier work this paper cites.
On compressing social networks
F. Chierichetti, R. Kumar, S. Lattanzi, M. Mitzenmacher, A. Panconesi, and P. Raghavan · 2009
Earlier work this paper cites.
Introduction to algorithms
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein · 2009
Earlier work this paper cites.
The Shortest Path Problem: Ninth DIMACS Implementation Challenge
C. Demetrescu, A. V. Goldberg, and D. S. Johnson · 2009
Earlier work this paper cites.
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
K. Madduri, D. Ediger, K. Jiang, D. A. Bader, and D. Chavarria-Miranda · 2009
Earlier work this paper cites.
A case for bufferless routing in on-chip networks
T. Moscibroda and O. Mutlu · 2009
Earlier work this paper cites.
A scalable, parallel algorithm for maximal clique enumeration
M. C. Schmidt, N. F. Samatova, K. Thomas, and B.-H. Park · 2009
Earlier work this paper cites.
A distributed algorithm to enumerate all maximal cliques in mapreduce
B. Wu, S. Yang, H. Zhao, and B. Wang · 2009
Earlier work this paper cites.
Graph data management and mining: A survey of algorithms and applications
C. C. Aggarwal and H. Wang · 2010
Earlier work this paper cites.
A survey of clustering algorithms for graph data
C. C. Aggarwal and H. Wang · 2010
Earlier work this paper cites.
Managing and mining graph data
C. C. Aggarwal, H. Wang, et al · 2010
Earlier work this paper cites.
Parallel Algorithms
G. E. Blelloch and B. M. Maggs · 2010
Earlier work this paper cites.
Listing all maximal cliques in sparse graphs in near-optimal time
D. Eppstein et al · 2010
Earlier work this paper cites.
Phase-change technology and the future of main memory
B. C. Lee, P. Zhou, J. Yang, Y. Zhang, B. Zhao, E. Ipek, O. Mutlu, and D. Burger · 2010
Earlier work this paper cites.
A survey of algorithms for dense subgraph discovery
V. E. Lee, N. Ruan, R. Jin, and C. Aggarwal · 2010
Earlier work this paper cites.
Kronecker graphs: An approach to modeling networks
J. Leskovec et al · 2010
Earlier work this paper cites.
dmaximalcliques: A distributed algorithm for enumerating all maximal cliques and maximal clique distribution
L. Lu, Y. Gu, and R. Grossman · 2010
Earlier work this paper cites.
Pregel: a system for large-scale graph processing
G. Malewicz, M. H. Austern, A. J. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski · 2010
Earlier work this paper cites.
Introducing the graph 500
R. C. Murphy et al · 2010
Earlier work this paper cites.
Honour thy neighbour—clique maintenance in dynamic graphs
T. J. Ottosen and J. Vomlel · 2010
Cited alongside, same era.
A survey of graph mining techniques for biological datasets
S. Parthasarathy, S. Tatikonda, and D. Ucar · 2010
Cited alongside, same era.
Graph mining applications to social network analysis
L. Tang and H. Liu · 2010
Cited alongside, same era.
Margin: Maximal frequent subgraph mining
L. T. Thomas, S. R. Valluri, and K. Karlapalem · 2010
Cited alongside, same era.
A survey of link prediction in social networks
M. Al Hasan and M. J. Zaki · 2011
Cited alongside, same era.
Models of Computation, Theoretical
G. Bilardi and A. Pietracaprina · 2011
Cited alongside, same era.
Lazypim: An efficient cache coherence mechanism for processing-in-memory
A. Boroumand, S. Ghose, M. Patel, H. Hassan, B. Lucia, K. Hsieh, K. T. Malladi, H. Zheng, and O. Mutlu · 2016
Later among the works it cites.
Better bitmap performance with roaring bitmaps
S. Chambi, D. Lemire, O. Kaser, and R. Godin · 2016
Later among the works it cites.
Change-sensitive algorithms for maintaining maximal cliques in a dynamic graph
A. Das, M. Svendsen, and S. Tirthapura · 2016
Later among the works it cites.
The sunway taihulight supercomputer: system and applications
H. Fu, J. Liao, J. Yang, L. Wang, Z. Song, X. Huang, C. Yang, W. Xue, F. Liu, F. Qiao, et al · 2016
Later among the works it cites.
Distributed ( δ \delta + 1)-coloring in sublogarithmic rounds
D. G. Harris, J. Schneider, and H.-H. Su · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. E. Blelloch · 2011
Cited alongside, same era.
Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks
P. Boldi, M. Rosa, M. Santini, and S. Vigna · 2011
Cited alongside, same era.
Listing all maximal cliques in large sparse real-world graphs
D. Eppstein and D. Strash · 2011
Cited alongside, same era.
Kilo-noc: A heterogeneous network-on-chip architecture for scalability and service guarantees
B. Grot, J. Hestness, S. W. Keckler, and O. Mutlu · 2011
Cited alongside, same era.
Link prediction in complex networks: A survey
L. Lü and T. Zhou · 2011
Cited alongside, same era.
Performance characteristics of Graph500 on large-scale distributed environment
T. Suzumura et al · 2011
Cited alongside, same era.
H. Hassan, G. Pekhimenko, N. Vijaykumar, V. Seshadri, D. Lee, O. Ergin, and O. Mutlu · 2016
Later among the works it cites.
Accelerating pointer chasing in 3d-stacked memory: Challenges, mechanisms, evaluation
K. Hsieh, S. Khan, N. Vijaykumar, K. K. Chang, A. Boroumand, S. Ghose, and O. Mutlu · 2016
Later among the works it cites.
Data mining techniques in social media: A survey
M. Injadat, F. Salo, and A. B. Nassif · 2016
Later among the works it cites.
Mathematical foundations of the graphblas
J. Kepner, P. Aaltonen, D. Bader, A. Buluç, F. Franchetti, J. Gilbert, D. Hutchison, M. Kumar, A. Lumsdaine, H. Meyerhenke, et al · 2016
Later among the works it cites.
Scheduling techniques for gpu architectures with processing-in-memory capabilities
A. Pattnaik, X. Tang, A. Jog, O. Kayiran, A. K. Mishra, M. T. Kandemir, O. Mutlu, and C. R. Das · 2016
Later among the works it cites.
Nscale: neighborhood-centric large-scale graph analytics in the cloud
A. Quamar, A. Deshpande, and J. Lin · 2016
Later among the works it cites.
High-performance distributed RMA locks
P. Schmid, M. Besta, and T. Hoefler · 2016
Later among the works it cites.
Benchmarking graph databases with cyclone benchmark
Y. Tang · 2016
Later among the works it cites.
Scalable and efficient algorithms for unstructured mesh computations
L. Thebault · 2016
Later among the works it cites.
Emptyheaded: A relational engine for graph processing
C. R. Aberger, A. Lamb, S. Tu, A. Nötzli, K. Olukotun, and C. Ré · 2017
Later among the works it cites.
To push or to pull: On reducing communication and synchronization in graph computations
M. Besta et al · 2017
Later among the works it cites.
Slimsell: A vectorizable graph representation for breadth-first search
M. Besta, F. Marending, E. Solomonik, and T. Hoefler · 2017
Later among the works it cites.
Introducing vf3: A new algorithm for subgraph isomorphism
V. Carletti et al · 2017
Later among the works it cites.
Maximal clique enumeration with data-parallel primitives
B. Lessley, T. Perciano, M. Mathai, H. Childs, and E. W. Bethel · 2017
Later among the works it cites.
Ambit: In-memory accelerator for bulk bitwise operations using commodity dram technology
V. Seshadri, D. Lee, T. Mullins, H. Hassan, A. Boroumand, J. Kim, M. A. Kozuch, O. Mutlu, P. B. Gibbons, and T. C. Mowry · 2017
Later among the works it cites.
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
E. Solomonik, M. Besta, F. Vella, and T. Hoefler · 2017
Later among the works it cites.
G-thinker: big graph mining made easier and faster
D. Yan, H. Chen, J. Cheng, M. T. Özsu, Q. Zhang, and J. Lui · 2017
Later among the works it cites.
Triangle counting in large networks: a review
M. Al Hasan and V. S. Dave · 2018
Later among the works it cites.
Parallel Computing is Everywhere
S. Bassini, M. Danelutto, and P. Dazzi · 2018
Later among the works it cites.
Slim noc: A low-diameter on-chip network topology for high energy efficiency and scalability
M. Besta, S. M. Hassan, S. Yalamanchili, R. Ausavarungnirun, O. Mutlu, and T. Hoefler · 2018
Later among the works it cites.
Survey and taxonomy of lossless graph compression and space-efficient graph representations
M. Besta and T. Hoefler · 2018
Later among the works it cites.
Log (graph): a near-optimal high-performance graph representation
M. Besta, D. Stanojevic, T. Zivic, J. Singh, M. Hoerold, and T. Hoefler · 2018
Later among the works it cites.
The VF3-light subgraph isomorphism algorithm: when doing less is more effective
V. Carletti et al · 2018
Later among the works it cites.
G-miner: an efficient task-oriented graph mining system
H. Chen, M. Liu, Y. Zhao, X. Yan, D. Yan, and J. Cheng · 2018
Later among the works it cites.
Listing k-cliques in sparse real-world graphs
M. Danisch et al · 2018
Later among the works it cites.
Shared-memory parallel maximal clique enumeration
A. Das et al · 2018
Later among the works it cites.
Transformations of high-level synthesis codes for high-performance computing
J. de Fine Licht, S. Meierhans, and T. Hoefler · 2018
Later among the works it cites.
Theoretically efficient parallel graph algorithms can be fast and scalable
L. Dhulipala et al · 2018
Later among the works it cites.
Graph theory
R. Diestel · 2018
Later among the works it cites.
Runtime scheduling policies for distributed graph algorithms
J. S. Firoz, M. Zalewski, A. Lumsdaine, and M. Barnas · 2018
Later among the works it cites.
Enabling highly scalable remote memory access programming with mpi-3 one sided
R. Gerstenberger, M. Besta, and T. Hoefler · 2018
Later among the works it cites.
Communication-avoiding parallel minimum cuts and connected components
L. Gianinazzi et al · 2018
Later among the works it cites.
Speeding up set intersections in graph algorithms using simd instructions
S. Han, L. Zou, and J. X. Yu · 2018
Later among the works it cites.
Pushing the envelope in overlapping communities detection
S. Jabbour, N. Mhadhbi, B. Raddaoui, and L. Sais · 2018
Later among the works it cites.
An efficient system for subgraph discovery
A. Joshi, Y. Zhang, P. Bogdanov, and J.-H. Hwang · 2018
Later among the works it cites.
Roaring bitmaps: Implementation of an optimized software library
D. Lemire, O. Kaser, N. Kurz, L. Deri, C. O’Hara, F. Saint-Jacques, and G. Ssi-Yan-Kai · 2018
Later among the works it cites.
Shentu: processing multi-trillion edge graphs on millions of cores in seconds
H. Lin et al · 2018
Later among the works it cites.
Graph summarization methods and applications: A survey
Y. Liu, T. Safavi, A. Dighe, and D. Koutra · 2018
Later among the works it cites.
An output sensitive algorithm for maximal clique enumeration in sparse graphs
G. Manoussakis · 2018
Later among the works it cites.
How powerful are graph neural networks?
K. Xu, W. Hu, J. Leskovec, and S. Jegelka · 2018
Later among the works it cites.
A modular benchmarking infrastructure for high-performance and reproducible deep learning
T. Ben-Nun, M. Besta, S. Huber, A. N. Ziogas, D. Peter, and T. Hoefler · 2019
Later among the works it cites.
Practice of streaming processing of dynamic graphs: Concepts, models, and systems
M. Besta, M. Fischer, V. Kalavri, M. Kapralov, and T. Hoefler · 2019
Later among the works it cites.
M. Besta, E. Peter, R. Gerstenberger, M. Fischer, M. Podstawski, C. Barthels, G. Alonso, and T. Hoefler · 2019
Later among the works it cites.
Graph processing on fpgas: Taxonomy, survey, challenges
M. Besta, D. Stanojevic, J. D. F. Licht, T. Ben-Nun, and T. Hoefler · 2019
Later among the works it cites.
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics
M. Besta, S. Weber, L. Gianinazzi, R. Gerstenberger, A. Ivanov, Y. Oltchik, and T. Hoefler · 2019
Later among the works it cites.
A parallel algorithm for subgraph isomorphism
V. Carletti et al · 2019
Later among the works it cites.
Pangolin: An efficient and flexible graph mining system on cpu and gpu
X. Chen, R. Dathathri, G. Gill, and K. Pingali · 2019
Later among the works it cites.
Network-accelerated non-contiguous memory transfers
S. Di Girolamo, K. Taranov, A. Kurth, M. Schaffner, T. Schneider, J. Beránek, M. Besta, L. Benini, D. Roweth, and T. Hoefler · 2019
Later among the works it cites.
Fractal: A general-purpose graph pattern mining system
V. Dias et al · 2019
Later among the works it cites.
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication
G. Kwasniewski, M. Kabić, M. Besta, J. VandeVondele, R. Solcà, and T. Hoefler · 2019
Later among the works it cites.
Graphzero: Breaking symmetry for efficient graph mining
D. Mawhirter, S. Reinehr, C. Holmes, T. Liu, and B. Wu · 2019
Later among the works it cites.
Automine: harmonizing high-level abstraction and high performance for graph mining
D. Mawhirter and B. Wu · 2019
Later among the works it cites.
A survey on subgraph counting: Concepts, algorithms and applications to network motifs and graphlets
P. Ribeiro, P. Paredes, M. E. Silva, D. Aparicio, and F. Silva · 2019
Later among the works it cites.
Gardenia: A graph processing benchmark suite for next-generation accelerators
Z. Xu, X. Chen, J. Shen, Y. Zhang, C. Chen, and C. Yang · 2019
Later among the works it cites.
Kaleido: An efficient out-of-core graph mining system on a single machine
C. Zhao, Z. Zhang, P. Xu, T. Zheng, and X. Cheng · 2019
Later among the works it cites.
High-performance parallel graph coloring with strong guarantees on work, depth, and quality
M. Besta, A. Carigiet, Z. Vonarburg-Shmaria, K. Janda, L. Gianinazzi, and T. Hoefler · 2020
Later among the works it cites.
High-performance routing with multipathing and path diversity in ethernet and hpc networks
M. Besta, J. Domke, M. Schneider, M. Konieczny, S. Di Girolamo, T. Schneider, A. Singla, and T. Hoefler · 2020
Later among the works it cites.
Substream-centric maximum matchings on fpga
M. Besta, M. Fischer, T. Ben-Nun, D. Stanojevic, J. D. F. Licht, and T. Hoefler · 2020
Later among the works it cites.
Communication-efficient jaccard similarity for high-performance distributed genome comparisons
M. Besta, R. Kanakagiri, H. Mustafa, M. Karasikov, G. Rätsch, T. Hoefler, and E. Solomonik · 2020
Later among the works it cites.
Fatpaths: Routing in supercomputers and data centers when shortest paths fall short
M. Besta, M. Schneider, K. Cynk, M. Konieczny, E. Henriksson, S. Di Girolamo, A. Singla, and T. Hoefler · 2020
Later among the works it cites.
Sebs: A serverless benchmark suite for function-as-a-service computing
M. Copik, G. Kwasniewski, M. Besta, M. Podstawski, and T. Hoefler · 2020
Later among the works it cites.
The graph based benchmark suite (gbbs)
L. Dhulipala, J. Shi, T. Tseng, G. E. Blelloch, and J. Shun · 2020
Later among the works it cites.
Peregrine: a pattern-aware graph mining system
K. Jamshidi, R. Mahadasa, and K. Vora · 2020
Later among the works it cites.
The future is big graphs! a community view on graph processing systems
S. Sakr, A. Bonifati, H. Voigt, A. Iosup, K. Ammar, R. Angles, W. Aref, M. Arenas, M. Besta, P. A. Boncz, et al · 2020
Later among the works it cites.
Parallel clique counting and peeling algorithms
J. Shi, L. Dhulipala, and J. Shun · 2020
Later among the works it cites.
A comprehensive survey on graph neural networks
Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and S. Y. Philip · 2020
Later among the works it cites.
Prefixfpm: A parallel framework for general-purpose frequent pattern mining
D. Yan, W. Qu, G. Guo, and X. Wang · 2020
Later among the works it cites.
A locality-aware energy-efficient accelerator for graph mining applications
P. Yao, L. Zheng, Z. Zeng, Y. Huang, C. Gui, X. Liao, H. Jin, and J. Xue · 2020
Later among the works it cites.
On the parallel i/o optimality of linear algebra kernels: near-optimal lu factorization
G. Kwasniewski, T. Ben-Nun, A. N. Ziogas, T. Schneider, M. Besta, and T. Hoefler · 2021
Closest in time.