On the public citation graph
CoCoS: Fast and Accurate Distributed Triangle Counting in Graph Streams
0 signed · 52 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-93040-4_51openalex-snapshot
Tri-Fly: Distributed Estimation of Global and Local Triangle Counts in Graph Streams
inferredcites →https://doi.org/10.1007/s10115-013-0693-zopenalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1007/s10115-017-1077-6openalex-snapshot
Patterns and anomalies in k-cores of real-world graphs with applications
inferredcites →https://doi.org/10.1007/s13278-010-0001-9openalex-snapshot
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation
inferredcites →https://doi.org/10.1016/j.ipl.2011.12.007openalex-snapshot
Colorful triangle counting and a MapReduce implementation
inferredcites →https://doi.org/10.1080/15427951.2009.10129177openalex-snapshot
Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
inferredcites →https://doi.org/10.1109/bigdata.2013.6691744openalex-snapshot
Approximate triangle counting algorithms on multi-cores
inferredcites →https://doi.org/10.1109/icde.2015.7113280openalex-snapshot
Multicore triangle computations without tuning
inferredcites →https://doi.org/10.1109/icde.2019.00073openalex-snapshot
REPT: A Streaming Algorithm of Approximating Global and Local Triangle Counts in Parallel
inferredcites →https://doi.org/10.1109/icdm.2008.72openalex-snapshot
Fast Counting of Triangles in Large Real Networks without Counting: Algorithms and Laws
inferredcites →https://doi.org/10.1109/icdm.2017.143openalex-snapshot
WRS: Waiting Room Sampling for Accurate Triangle Counting in Real Graph Streams
inferredcites →https://doi.org/10.1109/mcse.2009.120openalex-snapshot
Graph Twiddling in a MapReduce World
inferredcites →https://doi.org/10.1137/1.9781611974782.116openalex-snapshot
A Hybrid Sampling Scheme for Triangle Counting
inferredcites →https://doi.org/10.1137/s003614450342480openalex-snapshot
The Structure and Function of Complex Networks
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
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/1963405.1963491openalex-snapshot
Counting triangles and the curse of the last reducer
inferredcites →https://doi.org/10.1145/2433396.2433480openalex-snapshot
On the streaming complexity of computing local clustering coefficients
inferredcites →https://doi.org/10.1145/2487575.2487678openalex-snapshot
A space efficient streaming algorithm for triangle counting using the birthday paradox
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/2505515.2505741openalex-snapshot
Parallel triangle counting in massive streaming graphs
inferredcites →https://doi.org/10.1145/2661829.2662017openalex-snapshot
MapReduce Triangle Enumeration With Guarantees
inferredcites →https://doi.org/10.1145/2691190.2691193openalex-snapshot
I/O-Efficient Algorithms on Triangle Listing and Counting
inferredcites →https://doi.org/10.1145/3022186openalex-snapshot
Memory-Efficient and Accurate Sampling for Counting Local Triangles in Graph Streams
inferredcites →https://doi.org/10.1145/3237191openalex-snapshot
Enumerating Trillion Subgraphs On Distributed Systems
inferredcites →https://doi.org/10.14778/1921071.1921073openalex-snapshot
On triangulation-based dense neighborhood graph discovery
inferredcites →https://doi.org/10.14778/2556549.2556569openalex-snapshot
Counting and sampling triangles from a graph stream
inferredcites →https://doi.org/10.14778/2856318.2856327openalex-snapshot
Ego-net community mining applied to friend suggestion
inferredcites →https://doi.org/10.14778/3137628.3137651openalex-snapshot
On sampling from massive graph streams
inferredcites →https://doi.org/10.2307/1412159openalex-snapshot
The Proof and Measurement of Association between Two Things
inferredcites →https://doi.org/10.2307/2077235openalex-snapshot
Social Network Analysis: Methods and Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.knosys.2023.110878openalex-snapshot
A distributed streaming framework for edge–cloud triangle counting in graph streams
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.1109/access.2022.3190505openalex-snapshot
Isolation Forest Based on Minimal Spanning Tree
inferred← citeshttps://doi.org/10.1109/icc52391.2025.11160716openalex-snapshot
A Cloud-Edge Collaborative Framework for Distributed Triangle Counting on Graph Stream
inferred← citeshttps://doi.org/10.1109/srds64841.2024.00028openalex-snapshot
DTC: Real-Time and Accurate Distributed Triangle Counting in Fully Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1109/tbdata.2024.3522816openalex-snapshot
Cost-Aware Triangle Counting Over Geo-Distributed Datacenters
inferred← citeshttps://doi.org/10.1109/tkde.2024.3371228openalex-snapshot
Compact Estimator for Streaming Triangle Counting
inferred← citeshttps://doi.org/10.1109/tpds.2025.3627974openalex-snapshot
EDTC: Exact Triangle Counting for Dynamic Graphs on GPU
inferred← citeshttps://doi.org/10.1145/3494562openalex-snapshot
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream
inferred← citeshttps://doi.org/10.1145/3708597.3708610openalex-snapshot
DYTC:Dynamic Graph Triangle Counting on GPU
inferred← citeshttps://doi.org/10.1145/3771997openalex-snapshot
Fast Assessment of Eulerian Trails in Graphs with Applications
inferred← citeshttps://doi.org/10.14778/3734839.3734854openalex-snapshot
Truss Decomposition in Hypergraphs
inferred← citeshttps://doi.org/10.31274/td-20240329-372openalex-snapshot
Graphlet counting in massive networks
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.