On the public citation graph
Enumerating Trillion Subgraphs On Distributed Systems
0 signed · 64 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-06608-0_29openalex-snapshot
Net-Ray: Visualizing and Mining Billion-Scale Graphs
inferredcites →https://doi.org/10.1007/978-3-540-71681-5_7openalex-snapshot
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
inferredcites →https://doi.org/10.1007/978-3-642-15105-7_5openalex-snapshot
Discovering Community-Oriented Roles of Nodes in a Social Network
inferredcites →https://doi.org/10.1007/s00778-012-0283-9openalex-snapshot
gbase: an efficient analysis platform for large graphs
inferredcites →https://doi.org/10.1007/s00778-016-0427-4openalex-snapshot
Mining billion-scale tensors: algorithms and discoveries
inferredcites →https://doi.org/10.1007/s10115-010-0305-0openalex-snapshot
PEGASUS: mining peta-scale graphs
inferredcites →https://doi.org/10.1016/0022-0000(81)90033-7openalex-snapshot
New hash functions and their use in authentication and set equality
inferredcites →https://doi.org/10.1016/j.jpdc.2012.10.005openalex-snapshot
Inexact subgraph isomorphism in MapReduce
inferredcites →https://doi.org/10.1016/j.tcs.2008.07.017openalex-snapshot
Main-memory triangle computations for very large (sparse (power-law)) graphs
inferredcites →https://doi.org/10.1073/pnas.032093399openalex-snapshot
Curvature of co-links uncovers hidden thematic layers in the World Wide Web
inferredcites →https://doi.org/10.1073/pnas.0400054101openalex-snapshot
Defining and identifying communities in networks
inferredcites →https://doi.org/10.1103/physreve.83.056119openalex-snapshot
Tolerating the community detection resolution limit with edge weighting
inferredcites →https://doi.org/10.1109/icde.2013.6544814openalex-snapshot
Enumerating subgraph instances using map-reduce
inferredcites →https://doi.org/10.1109/icde.2016.7498292openalex-snapshot
SCouT: Scalable coupled matrix-tensor factorization - algorithm and discoveries
inferredcites →https://doi.org/10.1109/icdm.2009.14openalex-snapshot
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
inferredcites →https://doi.org/10.1109/icdm.2016.0053openalex-snapshot
Partition Aware Connected Component Computation in Distributed Systems
inferredcites →https://doi.org/10.1109/icpp.2015.46openalex-snapshot
PDTL: Parallel and Distributed Triangle Listing for Massive Graphs
inferredcites →https://doi.org/10.1109/mcse.2009.120openalex-snapshot
Graph Twiddling in a MapReduce World
inferredcites →https://doi.org/10.1109/tkde.2012.244openalex-snapshot
HEigen: Spectral Analysis for Billion-Scale Graphs
inferredcites →https://doi.org/10.1109/tkde.2016.2610420openalex-snapshot
Fully Scalable Methods for Distributed Tensor Factorization
inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot
A (sub)graph isomorphism algorithm for matching large graphs
inferredcites →https://doi.org/10.1109/tpds.2012.229openalex-snapshot
Parallel $(k)$-Clique Community Detection on Large-Scale Networks
inferredcites →https://doi.org/10.1145/1839490.1839494openalex-snapshot
Efficient algorithms for large-scale local triangle counting
inferredcites →https://doi.org/10.1145/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/2124295.2124374openalex-snapshot
The life and death of online groups
inferredcites →https://doi.org/10.1145/2505515.2505563openalex-snapshot
An efficient MapReduce algorithm for counting triangles in a very large graph
inferredcites →https://doi.org/10.1145/2556609openalex-snapshot
Uncovering social network Sybils in the wild
inferredcites →https://doi.org/10.1145/2588555.2588557openalex-snapshot
Parallel subgraph listing in a large-scale graph
inferredcites →https://doi.org/10.1145/2594538.2594552openalex-snapshot
The input/output complexity of triangle enumeration
inferredcites →https://doi.org/10.1145/2661829.2662017openalex-snapshot
MapReduce Triangle Enumeration With Guarantees
inferredcites →https://doi.org/10.1155/2007/52861openalex-snapshot
Algorithmic Aspects of Wireless Networks
inferredcites →https://doi.org/10.14778/2311906.2311907openalex-snapshot
Efficient subgraph matching on billion node graphs
inferredcites →https://doi.org/10.14778/2794367.2794368openalex-snapshot
Scalable subgraph enumeration in MapReduce
inferredcites →https://doi.org/10.14778/3055540.3055545openalex-snapshot
Distributed join algorithms on thousands of cores
inferredcites →https://doi.org/10.1609/aaai.v32i1.11372openalex-snapshot
PegasusN: A Scalable and Versatile Graph Mining System
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.5445/ir/1000007159openalex-snapshot
Algorithmic Aspects of Triangle-Based Network Analysis
inferredcites →https://doi.org/10.5555/2387880.2387883openalex-snapshot
PowerGraph: distributed graph-parallel computation on natural graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-95903-6_45openalex-snapshot
Practical Survey on MapReduce Subgraph Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-39847-6_32openalex-snapshot
Parallel Pattern Enumeration in Large Graphs
inferred← citeshttps://doi.org/10.1007/s10619-022-07416-8openalex-snapshot
Four node graphlet and triad enumeration on distributed platforms
inferred← citeshttps://doi.org/10.1016/j.ins.2022.05.096openalex-snapshot
Efficient game theoretic approach to dynamic graph partitioning
inferred← citeshttps://doi.org/10.1049/cit2.70184openalex-snapshot
Vertex Hashing Assignment‐Based Distributed Sampling Algorithm for Large‐Scale Dynamic Graph Stream
inferred← citeshttps://doi.org/10.1137/1.9781611976830.13openalex-snapshot
Parallel Clique Counting and Peeling Algorithms
inferred← citeshttps://doi.org/10.1145/3441487openalex-snapshot
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
inferred← citeshttps://doi.org/10.1145/3468791.3468805openalex-snapshot
Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale
inferred← citeshttps://doi.org/10.1145/3767110.3767137openalex-snapshot
TriPIM — Exact Triangle Counting on UPMEM Processing-in-Memory for Graph Analytics
inferred← citeshttps://doi.org/10.1371/journal.pone.0229936openalex-snapshot
PACC: Large scale connected component computation on Hadoop and Spark
inferred← citeshttps://doi.org/10.7287/peerj-cs.822v0.1/reviews/1openalex-snapshot
Peer Review #1 of "Recommendation algorithm based on attributed multiplex heterogeneous network (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.822v0.1/reviews/2openalex-snapshot
Peer Review #2 of "Recommendation algorithm based on attributed multiplex heterogeneous network (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.822v0.1/reviews/3openalex-snapshot
Peer Review #3 of "Recommendation algorithm based on attributed multiplex heterogeneous network (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.822v0.2/reviews/1openalex-snapshot
Peer Review #1 of "Recommendation algorithm based on attributed multiplex heterogeneous network (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.822openalex-snapshot
Recommendation algorithm based on attributed multiplex heterogeneous network
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.