On the public citation graph
Fast, Accurate and Provable Triangle Counting in Fully Dynamic Graph Streams
0 signed · 93 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/3-540-44436-x_10openalex-snapshot
Greedy Approximation Algorithms for Finding Dense Components in a Graph
inferredcites →https://doi.org/10.1007/978-1-4419-6045-0_10openalex-snapshot
A Survey of Algorithms for Dense Subgraph Discovery
inferredcites →https://doi.org/10.1007/978-3-030-10928-8_9openalex-snapshot
Think Before You Discard: Accurate Triangle Counting in Graph Streams with Deletions
inferredcites →https://doi.org/10.1007/978-3-319-08404-6_27openalex-snapshot
Triangle Counting in Dynamic Graph Streams
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/978-3-540-95995-3_3openalex-snapshot
Finding Dense Subgraphs with Size Bounds
inferredcites →https://doi.org/10.1007/978-3-642-02927-1_50openalex-snapshot
On Finding Dense Subgraphs
inferredcites →https://doi.org/10.1007/978-3-662-48054-0_39openalex-snapshot
Densest Subgraph in Dynamic Graph Streams
inferredcites →https://doi.org/10.1007/bf02289146openalex-snapshot
A Method of Matrix Analysis of Group Structure
inferredcites →https://doi.org/10.1007/s00778-007-0065-yopenalex-snapshot
Maintaining bounded-size sample synopses of evolving datasets
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/s10618-019-00630-6openalex-snapshot
FURL: Fixed-memory and uncertainty reducing local triangle counting for multigraph streams
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.1103/physreve.83.056119openalex-snapshot
Tolerating the community detection resolution limit with edge weighting
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.2015.61openalex-snapshot
A General Suspiciousness Metric for Dense Blocks in Multimodal Data
inferredcites →https://doi.org/10.1137/s003614450342480openalex-snapshot
The Structure and Function of Complex Networks
inferredcites →https://doi.org/10.1137/s0097539701398363openalex-snapshot
Maintaining Stream Statistics over Sliding Windows
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social 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/2382577.2382581openalex-snapshot
Triangle listing in massive networks
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.2505741openalex-snapshot
Parallel triangle counting in massive streaming graphs
inferredcites →https://doi.org/10.1145/2691190.2691193openalex-snapshot
I/O-Efficient Algorithms on Triangle Listing and Counting
inferredcites →https://doi.org/10.1145/2736277.2741638openalex-snapshot
Efficient Densest Subgraph Computation in Evolving Graphs
inferredcites →https://doi.org/10.1145/2746539.2746592openalex-snapshot
Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
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/3056563openalex-snapshot
Graph-Based Fraud Detection in the Face of Camouflage
inferredcites →https://doi.org/10.1145/3154414openalex-snapshot
Fast, Accurate, and Flexible Algorithms for Dense Subtensor Mining
inferredcites →https://doi.org/10.1177/104649647100200201openalex-snapshot
Transitivity in Structural Models of Small Groups
inferredcites →https://doi.org/10.14778/2140436.2140442openalex-snapshot
Densest subgraph in streaming and MapReduce
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.14778/3149193.3149197openalex-snapshot
Approximately counting triangles in large graph streams including edge duplicates with a fixed memory usage
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.
inferredcites →https://doi.org/10.48550/arxiv.1404.4696openalex-snapshot
Triangle counting in dynamic graph streams
inferredcites →https://doi.org/10.5555/545381.545464openalex-snapshot
Reductions in streaming algorithms, with an application to counting triangles in graphs
inferredcites →https://doi.org/10.5555/545381.545465openalex-snapshot
Sampling from a moving window over streaming data
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.70057openalex-snapshot
In‐Memory Binary Vector‐Matrix Multiplication Circuit Design for Triangle Counting Algorithm Acceleration
inferred← citeshttps://doi.org/10.1007/978-3-032-16649-4_22openalex-snapshot
Dynamics of Triadic Closure in Complex Networks
inferred← citeshttps://doi.org/10.1007/s00778-020-00624-7openalex-snapshot
Temporal locality-aware sampling for accurate triangle counting in real graph streams
inferred← citeshttps://doi.org/10.1007/s00778-023-00783-3openalex-snapshot
Sliding window-based approximate triangle counting with bounded memory usage
inferred← citeshttps://doi.org/10.1007/s00778-023-00827-8openalex-snapshot
Hypergraph motifs and their extensions beyond binary
inferred← citeshttps://doi.org/10.1007/s10115-021-01543-xopenalex-snapshot
Tracking triadic cardinality distributions for burst detection in high-speed graph streams
inferred← citeshttps://doi.org/10.1007/s10618-023-00940-wopenalex-snapshot
Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm
inferred← citeshttps://doi.org/10.1007/s11280-022-01117-zopenalex-snapshot
Top-k heavy weight triangles listing on graph stream
inferred← citeshttps://doi.org/10.1007/s11704-023-2656-1openalex-snapshot
A survey on dynamic graph processing on GPUs: concepts, terminologies and systems
inferred← citeshttps://doi.org/10.1007/s13278-023-01157-xopenalex-snapshot
An adaptive graph sampling framework for graph analytics
inferred← citeshttps://doi.org/10.1007/s40745-020-00301-0openalex-snapshot
Spectral Algorithms for Streaming Graph Analysis: A Survey
inferred← citeshttps://doi.org/10.1007/s41019-022-00184-6openalex-snapshot
ripple2vec: Node Embedding with Ripple Distance of Structures
inferred← citeshttps://doi.org/10.1007/s41019-024-00279-2openalex-snapshot
Sliding-ITeM: An Adaptive-Size Graph Stream Summarization Structure Based on Sliding Windows
inferred← citeshttps://doi.org/10.1016/j.ipm.2024.103762openalex-snapshot
Conditional heavy hitter monitoring and application of heterogeneous graph streams based on sketches
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.3177620openalex-snapshot
Efficient Retrieval of Top-k Weighted Triangles on Static and Dynamic Spatial Data
inferred← citeshttps://doi.org/10.1109/ddcls66240.2025.11065220openalex-snapshot
Degree-Based triangle classification algorithm for graph data
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/icde53745.2022.00254openalex-snapshot
Horae: A Graph Stream Summarization Structure for Efficient Temporal Range Query
inferred← citeshttps://doi.org/10.1109/icde55515.2023.00088openalex-snapshot
Reinforcement Learning Enhanced Weighted Sampling for Accurate Subgraph Counting on Fully Dynamic Graph Streams
inferred← citeshttps://doi.org/10.1109/icde60146.2024.00226openalex-snapshot
Counting Butterflies in Fully Dynamic Bipartite Graph Streams
inferred← citeshttps://doi.org/10.1109/icdm59182.2024.00010openalex-snapshot
Fast and Accurate Triangle Counting in Graph Streams Using Predictions
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/tkde.2023.3272657openalex-snapshot
Balanced and Unbalanced Triangle Count in Signed Networks
inferred← citeshttps://doi.org/10.1142/s021819402140012xopenalex-snapshot
BSR-TC: Adaptively Sampling for Accurate Triangle Counting over Evolving Graph Streams
inferred← citeshttps://doi.org/10.1145/3448016.3452800openalex-snapshot
Sliding Window-based Approximate Triangle Counting over Streaming Graphs with Duplicate Edges
inferred← citeshttps://doi.org/10.1145/3487351.3489471openalex-snapshot
Approximating 4-cliques in streaming graphs
inferred← citeshttps://doi.org/10.1145/3494562openalex-snapshot
Distributed Triangle Approximately Counting Algorithms in Simple Graph Stream
inferred← citeshttps://doi.org/10.1145/3495011openalex-snapshot
sGrapp: Butterfly Approximation in Streaming Graphs
inferred← citeshttps://doi.org/10.1145/3848520openalex-snapshot
Efficient and Complete Triangle Counting in Hypergraph Streams
inferred← citeshttps://doi.org/10.14778/3742728.3742748openalex-snapshot
Efficient and Adaptive Estimation of Local Triadic Coefficients
inferred← citeshttps://doi.org/10.18293/seke2021-012openalex-snapshot
Triangle Counting by Adaptively Resampling over Evolving Graph Streams
inferred← citeshttps://doi.org/10.32657/10356/176240openalex-snapshot
Efficient algorithms for subgraph counting and enumeration on large graphs
inferred← citeshttps://doi.org/10.3390/app12147210openalex-snapshot
Mosar: Efficiently Characterizing Both Frequent and Rare Motifs in Large Graphs
inferred← citeshttps://doi.org/10.38124/ijsrmt.v2i11.1078openalex-snapshot
Integrating ETL Workflows with LLM-Augmented Data Mapping for Automated Business Intelligence Systems
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.