On the public citation graph
PDTL: Parallel and Distributed Triangle Listing for Massive Graphs
0 signed · 55 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.1016/j.socnet.2009.02.002openalex-snapshot
Clustering in weighted networks
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1109/icpp.2015.46openalex-snapshot
PDTL: Parallel and Distributed Triangle Listing for Massive Graphs
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1401890.1401898openalex-snapshot
Efficient semi-streaming algorithms for local triangle counting in massive graphs
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/2382577.2382581openalex-snapshot
Triangle listing in massive networks
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.1145/48529.48535openalex-snapshot
The input/output complexity of sorting and related problems
inferredcites →https://doi.org/10.14778/1921071.1921073openalex-snapshot
On triangulation-based dense neighborhood graph discovery
inferredcites →https://doi.org/10.14778/2311906.2311909openalex-snapshot
Truss decomposition in massive networks
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-57796-4_22openalex-snapshot
Triangle Enumeration on Massive Graphs Using AWS Lambda Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-59416-9_31openalex-snapshot
AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1007/978-981-99-6222-8_46openalex-snapshot
Parallelize Accelerated Triangle Counting Using Bit-Wise on GPU
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.09.008openalex-snapshot
CIC-PIM: Trading spare computing power for memory space in graph processing
inferred← citeshttps://doi.org/10.1109/access.2019.2901025openalex-snapshot
LiteTE: Lightweight, Communication-Efficient Distributed-Memory Triangle Enumerating
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091036openalex-snapshot
TriX: Triangle counting at extreme scale
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916438openalex-snapshot
DistTC: High Performance Distributed Triangle Counting
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916492openalex-snapshot
H-INDEX: Hash-Indexing for Parallel Triangle Counting on GPUs
inferred← citeshttps://doi.org/10.1109/hpec58863.2023.10363465openalex-snapshot
Triangle Counting Through Cover-Edges
inferred← citeshttps://doi.org/10.1109/icde.2019.00073openalex-snapshot
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
inferred← citeshttps://doi.org/10.1109/icdm.2016.0021openalex-snapshot
On Efficient External-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1109/icdm.2017.15openalex-snapshot
Improving I/O Complexity of Triangle Enumeration
inferred← citeshttps://doi.org/10.1109/isca52012.2021.00052openalex-snapshot
FlexMiner: A Pattern-Aware Accelerator for Graph Pattern Mining
inferred← citeshttps://doi.org/10.1109/sc.2018.00017openalex-snapshot
TriCore: Parallel Triangle Counting on GPUs
inferred← citeshttps://doi.org/10.1109/tkde.2018.2858820openalex-snapshot
On Efficient External-Memory Triangle Listing
inferred← citeshttps://doi.org/10.1109/tkde.2020.3003259openalex-snapshot
Improving I/O Complexity of Triangle Enumeration
inferred← citeshttps://doi.org/10.1109/tpds.2021.3064892openalex-snapshot
Trust: Triangle Counting Reloaded on GPUs
inferred← citeshttps://doi.org/10.1109/tpds.2021.3135329openalex-snapshot
TCStream: Large-Scale Graph Triangle-Counting on a single Machine using GPUs
inferred← citeshttps://doi.org/10.1145/3034786.3034790openalex-snapshot
On Asymptotic Cost of Triangle Listing in Random Graphs
inferred← citeshttps://doi.org/10.1145/3237191openalex-snapshot
Enumerating Trillion Subgraphs On Distributed Systems
inferred← citeshttps://doi.org/10.1145/3448016.3452815openalex-snapshot
Accelerating Triangle Counting on GPU
inferred← citeshttps://doi.org/10.1145/3567955.3567956openalex-snapshot
DecoMine: A Compilation-Based Graph Pattern Mining System with Pattern Decomposition
inferred← citeshttps://doi.org/10.1145/3627535.3638490openalex-snapshot
INFINEL: An efficient GPU-based processing method for unpredictable large output graph queries
inferred← citeshttps://doi.org/10.1145/3731599.3767570openalex-snapshot
Towards Efficient Load Balancing BFS on GPUs: One Code for AMD, Intel & Nvidia
inferred← citeshttps://doi.org/10.1145/3777884.3797002openalex-snapshot
LSTC: Large-Scale Triangle Counting on Single GPU
inferred← citeshttps://doi.org/10.14778/3149193.3149197openalex-snapshot
Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage
inferred← citeshttps://doi.org/10.31274/td-20240329-372openalex-snapshot
Graphlet counting in massive networks
inferred← citeshttps://doi.org/10.48550/arxiv.1911.06969openalex-snapshot
Pangolin: An Efficient and Flexible Graph Pattern Mining System on CPU and GPU
inferred← citeshttps://doi.org/10.48550/arxiv.2011.03135openalex-snapshot
Sandslash: A Two-Level Framework for Efficient Graph Pattern Mining
showing the first 34 of 35 · page through all 35
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.