On the public citation graph
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
0 signed · 310 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.1002/3527602755.ch1openalex-snapshot
Mathematical results on scale‐free random graphs
inferredcites →https://doi.org/10.1007/11427186_54openalex-snapshot
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
inferredcites →https://doi.org/10.1007/bf02523189openalex-snapshot
Finding and counting given length cycles
inferredcites →https://doi.org/10.1016/s0020-0190(00)00047-8openalex-snapshot
Finding and counting small induced subgraphs efficiently
inferredcites →https://doi.org/10.1016/s0378-8733(01)00035-1openalex-snapshot
A subquadratic triad census algorithm for large sparse networks with small maximum degree
inferredcites →https://doi.org/10.1016/s0747-7171(08)80013-2openalex-snapshot
Matrix multiplication via arithmetic progressions
inferredcites →https://doi.org/10.1073/pnas.012582999openalex-snapshot
Random graph models of social networks
inferredcites →https://doi.org/10.1080/0022250x.1979.9989889openalex-snapshot
Matrix measures for transitivity and balance*
inferredcites →https://doi.org/10.1126/science.298.5594.824openalex-snapshot
Network Motifs: Simple Building Blocks of Complex Networks
inferredcites →https://doi.org/10.1145/316188.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.2307/410727openalex-snapshot
Toward a General Calculus of Phonemic Distribution
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4016393openalex-extracted
Breaking the Hegemony of the Triangle Method in Clique Detection
inferred← citeshttps://doi.org/10.2139/ssrn.4729167openalex-extracted
Finding Small Complete Subgraphs Efficiently
inferred← citeshttps://doi.org/10.1002/sam.11224openalex-snapshot
Wedge sampling for computing clustering coefficients and triangle counts on large graphs †
inferred← citeshttps://doi.org/10.1002/widm.1226openalex-snapshot
Triangle counting in large networks: a review
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_489openalex-snapshot
Social Network Analysis, Large-Scale
inferred← citeshttps://doi.org/10.1007/978-1-4419-6045-0_16openalex-snapshot
Graph Mining Applications to Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_177openalex-snapshot
Social Network Analysis, Large-Scale
inferred← citeshttps://doi.org/10.1007/978-3-030-03599-0_5openalex-snapshot
Higher-Order Structure-Based Graph Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-030-11286-8_6openalex-snapshot
On Counting Triangles Through Edge Sampling in Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-25027-0_22openalex-snapshot
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-30493-5_53openalex-snapshot
Signed Graph Attention Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-34637-9_27openalex-snapshot
High-Efficiency Triangle Counting on the GPU
inferred← citeshttps://doi.org/10.1007/978-3-030-59003-1_4openalex-snapshot
Accelerating All 5-Vertex Subgraphs Counting Using GPUs
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-3-030-65351-4_48openalex-snapshot
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter
inferred← citeshttps://doi.org/10.1007/978-3-030-75075-6_9openalex-snapshot
Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-15740-0_8openalex-snapshot
Parallel Discovery of Top-k Weighted Motifs in Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-00372-6_7openalex-snapshot
Pattern Extraction from Graphs and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-319-11749-2_18openalex-snapshot
Common Neighbor Query-Friendly Triangulation-Based Large-Scale Graph Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-13123-8_4openalex-snapshot
Efficient Computation of the Weighted Clustering Coefficient
inferred← citeshttps://doi.org/10.1007/978-3-319-21786-4_25openalex-snapshot
Breaking Bad: Finding Triangle-Breaking Points in Large Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_17openalex-snapshot
A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques
inferred← citeshttps://doi.org/10.1007/978-3-319-71249-9_37openalex-snapshot
K-Clique-Graphs for Dense Subgraph Discovery
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_55openalex-snapshot
Estimating Clustering Indexes in Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_63openalex-snapshot
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-18009-5_3openalex-snapshot
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-642-37450-0_23openalex-snapshot
Parallel Triangle Counting over Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_51openalex-snapshot
Detecting and Counting Small Pattern Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-45438-7_25openalex-snapshot
The Network of the International Criminal Court Decisions as a Complex System
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_22openalex-snapshot
Computing the Degeneracy of Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-55195-6_26openalex-snapshot
Parallel Seed-Based Approach to Protein Structure Similarity Detection
inferred← citeshttps://doi.org/10.1007/978-3-662-44900-4_3openalex-snapshot
Sublinear Algorithms for Extreme-Scale Data Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-49529-2_32openalex-snapshot
Tight Approximations of Degeneracy in Large Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_9openalex-snapshot
Parameterized Aspects of Triangle Enumeration
inferred← citeshttps://doi.org/10.1007/978-981-15-7981-3_8openalex-snapshot
Identifying Vital Nodes in Social Networks Using an Evidential Methodology Combining with High-Order Analysis
inferred← citeshttps://doi.org/10.1007/978-981-19-8300-9_13openalex-snapshot
Implementation and Optimization of Graph Computing Algorithms Based on Graph Database
inferred← citeshttps://doi.org/10.1007/s00446-020-00373-4openalex-snapshot
Fooling views: a new lower bound technique for distributed computations under congestion
inferred← citeshttps://doi.org/10.1007/s00453-022-01063-2openalex-snapshot
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
inferred← citeshttps://doi.org/10.1007/s00500-021-06468-9openalex-snapshot
Truss decomposition using triangle graphs
inferred← citeshttps://doi.org/10.1007/s00778-015-0379-0openalex-snapshot
Top-K structural diversity search in large networks
inferred← citeshttps://doi.org/10.1007/s00778-022-00746-0openalex-snapshot
Accelerated butterfly counting with vertex priority on bipartite graphs
inferred← citeshttps://doi.org/10.1007/s10115-010-0291-2openalex-snapshot
Counting triangles in real-world networks using projections
inferred← citeshttps://doi.org/10.1007/s10115-014-0800-9openalex-snapshot
Triangle minimization in large networks
inferred← citeshttps://doi.org/10.1007/s10115-015-0829-4openalex-snapshot
Hypergraph querying using structural indexing and layer-related-closure verification
inferred← citeshttps://doi.org/10.1007/s10115-018-1296-5openalex-snapshot
Scalable approximations to k-cycle transversal problems on dynamic networks
inferred← citeshttps://doi.org/10.1007/s10618-016-0451-4openalex-snapshot
An efficient exact algorithm for triangle listing in large graphs
inferred← citeshttps://doi.org/10.1007/s10619-017-7193-1openalex-snapshot
Efficient MapReduce algorithms for triangle listing in billion-scale graphs
inferred← citeshttps://doi.org/10.1007/s10619-019-07276-9openalex-snapshot
A survey of current challenges in partitioning and processing of graph-structured data in parallel and distributed systems
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.1007/s10619-023-07437-xopenalex-snapshot
Balanced parallel triangle enumeration with an adaptive algorithm
inferred← citeshttps://doi.org/10.1007/s11227-017-2040-8openalex-snapshot
CCFinder: using Spark to find clustering coefficient in big graphs
inferred← citeshttps://doi.org/10.1007/s11280-019-00762-1openalex-snapshot
Dolha - an efficient and exact data structure for streaming graphs
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/s11590-011-0302-6openalex-snapshot
Discretization orders for distance geometry problems
inferred← citeshttps://doi.org/10.1007/s11590-018-1330-2openalex-snapshot
The maximum number of induced open triangles in graphs of a given order
inferred← citeshttps://doi.org/10.1007/s13278-010-0001-9openalex-snapshot
Spectral counting of triangles via element-wise sparsification and triangle-based link recommendation
inferred← citeshttps://doi.org/10.1007/s13278-017-0426-5openalex-snapshot
Vulnerability of clustering under node failure in complex networks
inferred← citeshttps://doi.org/10.1016/j.cmpb.2014.04.001openalex-snapshot
Epileptic seizure detection in EEGs signals using a fast weighted horizontal visibility algorithm
inferred← citeshttps://doi.org/10.1016/j.comnet.2013.04.007openalex-snapshot
Towards a bipartite graph modeling of the internet topology
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.125205openalex-snapshot
SiSRS: Signed social recommender system using deep neural network representation learning
inferred← citeshttps://doi.org/10.1016/j.future.2019.06.033openalex-snapshot
TSH: Easy-to-be distributed partitioning for large-scale graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2015.12.006openalex-snapshot
iTri: Index-based triangle listing in massive graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2018.02.018openalex-snapshot
Summarized bit batch-based triangle listing in massive graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.01.008openalex-snapshot
Efficient approximation algorithms for shortest cycles in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.02.010openalex-snapshot
Are unique subgraphs not easier to find?
inferred← citeshttps://doi.org/10.1016/j.is.2019.03.014openalex-snapshot
KTMiner: Distributed k-truss detection in big graphs
inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2012.02.007openalex-snapshot
Spatial content-based scene similarity assessment
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.004openalex-snapshot
Parameterized aspects of triangle enumeration
inferred← citeshttps://doi.org/10.1016/j.jeconc.2024.100123openalex-snapshot
Using data analytics to distinguish legitimate and illegitimate shell companies
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.07.006openalex-snapshot
Exploring big graph computing — An empirical study from architectural perspective
inferred← citeshttps://doi.org/10.1016/j.physa.2019.04.142openalex-snapshot
Impact of structural balance on Self-Avoiding Pruning Walk
inferred← citeshttps://doi.org/10.1016/j.socnet.2022.12.001openalex-snapshot
Weighted transitivity scores that account for triadic edge similarity in undirected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.07.017openalex-snapshot
Main-memory triangle computations for very large (sparse (power-law)) graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.025openalex-snapshot
A second look at counting triangles in graph streams
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.020openalex-snapshot
A second look at counting triangles in graph streams (corrected)
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.10.028openalex-snapshot
A fast deterministic detection of small pattern graphs in graphs without large cliques
inferred← citeshttps://doi.org/10.1017/nws.2020.35openalex-snapshot
Learning to count: A deep learning framework for graphlet count estimation
inferred← citeshttps://doi.org/10.1080/15427951.2012.625260openalex-snapshot
Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning
inferred← citeshttps://doi.org/10.1080/15427951.2015.1037030openalex-snapshot
Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?
inferred← citeshttps://doi.org/10.1080/15427951.2016.1198281openalex-snapshot
Efficient computation of the Weighted Clustering Coefficient
inferred← citeshttps://doi.org/10.1093/comjnl/bxw074openalex-snapshot
Editorial: Zero-Knowledge-Private Counting of Group Triangles in Social Networks
inferred← citeshttps://doi.org/10.1093/comnet/cnab023openalex-snapshot
Locating highly connected clusters in large networks with HyperLogLog counters
inferred← citeshttps://doi.org/10.1093/comnet/cnac002openalex-snapshot
Cliques in geometric inhomogeneous random graphs
inferred← citeshttps://doi.org/10.1093/comnet/cnac051openalex-snapshot
BFS-based distributed algorithm for parallel local-directed subgraph enumeration
inferred← citeshttps://doi.org/10.1093/comnet/cnw002openalex-snapshot
Analysing the first case of the International Criminal Court from a network-science perspective
inferred← citeshttps://doi.org/10.1098/rspa.2019.0724openalex-snapshot
A framework for second-order eigenvector centralities and clustering coefficients
inferred← citeshttps://doi.org/10.1109/access.2017.2672666openalex-snapshot
Transitivity Demolition and the Fall of Social Networks
inferred← citeshttps://doi.org/10.1109/asonam.2009.32openalex-snapshot
Spectral Counting of Triangles in Power-Law Networks via Element-Wise Sparsification
inferred← citeshttps://doi.org/10.1109/bigcomp.2016.7425819openalex-snapshot
Exploiting CPU parallelism for triangle listing using hybrid summarized bit batch vector
inferred← citeshttps://doi.org/10.1109/bigdata.2016.7840674openalex-snapshot
Efficient triangle listing for billion-scale graphs
inferred← citeshttps://doi.org/10.1109/bigdata.congress.2014.13openalex-snapshot
Rectangle Counting in Large Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9005513openalex-snapshot
Finding Mutual X at WeChat-Scale Social Network in Ten Minitues
inferred← citeshttps://doi.org/10.1109/cason.2011.6085933openalex-snapshot
Finding approximately similar patterns in social networks
inferred← citeshttps://doi.org/10.1109/cvpr.2019.00625openalex-snapshot
Combinatorial Persistency Criteria for Multicut and Max-Cut
inferred← citeshttps://doi.org/10.1109/edis63605.2024.10783167openalex-snapshot
Extending TWJ for Triangles Detection in Large Graphs
inferred← citeshttps://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferred← citeshttps://doi.org/10.1109/focs.2015.44openalex-snapshot
Approximately Counting Triangles in Sublinear Time
inferred← citeshttps://doi.org/10.1109/hipc.2017.00011openalex-snapshot
Exact and Parallel Triangle Counting in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/hpcc/smartcity/dss.2019.00304openalex-snapshot
Memory-Efficient GPU-Based Exact and Parallel Triangle Counting in Large Graphs
inferred← citeshttps://doi.org/10.1109/hpec.2016.7761622openalex-snapshot
cuSTINGER: Supporting dynamic graph algorithms for GPUs
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091034openalex-snapshot
Static graph challenge on GPU
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091036openalex-snapshot
TriX: Triangle counting at extreme scale
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091038openalex-snapshot
Quickly finding a truss in a haystack
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091042openalex-snapshot
Collaborative (CPU + GPU) algorithms for triangle counting and truss decomposition on the Minsky architecture: Static graph challenge: Subgraph isomorphism
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091051openalex-snapshot
Triangle counting for scale-free graphs at scale in distributed memory
inferred← citeshttps://doi.org/10.1109/hpec.2017.8091053openalex-snapshot
Triangle counting via vectorized set intersection
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547536openalex-snapshot
Triangle Counting and Truss Decomposition using FPGA
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547563openalex-snapshot
Fast Triangle Counting Using Cilk
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547569openalex-snapshot
Preliminary Exploration of Large-Scale Triangle Counting on Shared-Memory Multicore System
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547572openalex-snapshot
K-truss decomposition for Scale-Free Graphs at Scale in Distributed Memory
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547581openalex-snapshot
Logarithmic Radix Binning and Vectorized Triangle Counting
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547735openalex-snapshot
Discovering $k$ -Trusses in Large-Scale Networks
inferred← citeshttps://doi.org/10.1109/hpec.2018.8547759openalex-snapshot
Fast and Adaptive List Intersections on the GPU
inferred← citeshttps://doi.org/10.1109/hpec.2019.8916307openalex-snapshot
Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems
inferred← citeshttps://doi.org/10.1109/hpec58863.2023.10363465openalex-snapshot
Triangle Counting Through Cover-Edges
inferred← citeshttps://doi.org/10.1109/hpec58863.2023.10363539openalex-snapshot
Fast Triangle Counting
inferred← citeshttps://doi.org/10.1109/hpec67600.2025.11196094openalex-snapshot
Evaluating Efficiency and Novelty of LLM-Generated Code for Graph Analysis
inferred← citeshttps://doi.org/10.1109/ia335182.2014.10612668openalex-snapshot
Fast Triangle Counting on the GPU
inferred← citeshttps://doi.org/10.1109/icde.2015.7113280openalex-snapshot
Multicore triangle computations without tuning
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/icde.2019.00241openalex-snapshot
Cohesive Subgraph Computation Over Large Sparse Graphs
inferred← citeshttps://doi.org/10.1109/icde51399.2021.00119openalex-snapshot
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/icdew.2019.000-8openalex-snapshot
Triangle Counting on GPU Using Fine-Grained Task Distribution
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/icdm.2017.33openalex-snapshot
Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks
inferred← citeshttps://doi.org/10.1109/icdm.2017.55openalex-snapshot
Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs
inferred← citeshttps://doi.org/10.1109/icpads60453.2023.00117openalex-snapshot
GraphPar: Efficient Workload-Aware Subgraph Matching System on Multiple GPUs
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00136openalex-snapshot
Building Trusted Startup Teams From LinkedIn Attributes: A Higher Order Probabilistic Analysis
inferred← citeshttps://doi.org/10.1109/ictbig59752.2023.10456045openalex-snapshot
New Decision-Making Process Based on Set Theory: Towards Application of Set Theory
inferred← citeshttps://doi.org/10.1109/icws62655.2024.00060openalex-snapshot
Privacy-Preserving Approximate Calculation of Subgraphs in Social Networking Services
inferred← citeshttps://doi.org/10.1109/infcomw.2009.5072135openalex-snapshot
Efficient Measurement of Complex Networks Using Link Queries
inferred← citeshttps://doi.org/10.1109/infocom.2008.227openalex-snapshot
Complex Network Measurements: Estimating the Relevance of Observed Properties
inferred← citeshttps://doi.org/10.1109/ipdps.2016.122openalex-snapshot
Subgraph Counting: Color Coding Beyond Trees
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00036openalex-snapshot
Asynchronous Distributed-Memory Triangle Counting and LCC with RMA Caching
inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.108openalex-snapshot
Counting Triangles in Large Graphs on GPU
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.144openalex-snapshot
Fast Parallel Graph Triad Census and Triangle Counting on Shared-Memory Platforms
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.146openalex-snapshot
Deriving Streaming Graph Algorithms from Static Definitions
inferred← citeshttps://doi.org/10.1109/isbi61048.2026.11516043openalex-snapshot
Counterfactual Analysis of Brain Dynamics
inferred← citeshttps://doi.org/10.1109/sbac-pad.2012.39openalex-snapshot
Scalable Triadic Analysis of Large-Scale Graphs: Multi-core vs. Multi-processor vs. Multi-threaded Shared Memory Architectures
inferred← citeshttps://doi.org/10.1109/sc.companion.2012.250openalex-snapshot
Abstract: Parallel Algorithms for Counting Triangles and Computing Clustering Coefficients
inferred← citeshttps://doi.org/10.1109/socialcom.2013.51openalex-snapshot
Faster Clustering Coefficient Using Vertex Covers
inferred← citeshttps://doi.org/10.1109/tbdata.2018.2889120openalex-snapshot
Scalable Triangle Discovery Algorithm for Large Scale-Free Network with Limited Internal Memory
inferred← citeshttps://doi.org/10.1109/tit.2023.3296827openalex-snapshot
On the Number of Graphs With a Given Histogram
inferred← citeshttps://doi.org/10.1109/tkde.2016.2556663openalex-snapshot
Counting Triangles in Large Graphs by Random Sampling
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/tnse.2021.3056329openalex-snapshot
Subgraph Matching on Multiplex Networks
inferred← citeshttps://doi.org/10.1109/tpds.2017.2735405openalex-snapshot
High Performance Exact Triangle Counting on GPUs
inferred← citeshttps://doi.org/10.1109/tsg.2016.2572302openalex-snapshot
Stability and Performance of Coalitions of Prosumers Through Diversification in the Smart Grid
inferred← citeshttps://doi.org/10.1111/tgis.12787openalex-snapshot
Building k‐partite association graphs for finding recommendation patterns from questionnaire data
inferred← citeshttps://doi.org/10.1126/science.aad9029openalex-snapshot
Higher-order organization of complex networks
inferred← citeshttps://doi.org/10.1134/s1990478922010112openalex-snapshot
On the Maximum Number of Open Triangles in Graphs with the Same Number of Vertices and Edges
inferred← citeshttps://doi.org/10.1134/s1990478924030128openalex-snapshot
On the Maximum Number of Open Triangles in Graphs with Few Edges
inferred← citeshttps://doi.org/10.1134/s1990478925020103openalex-snapshot
On Graphs with Small Number of Edges Having Extremal Number of Open Triangles
inferred← citeshttps://doi.org/10.1137/1.9781611972832.2openalex-snapshot
Triadic Measures on Graphs: The Power of Wedge Sampling
inferred← citeshttps://doi.org/10.1137/1.9781611972900.10openalex-snapshot
Employing (1 − ∊) Dominating Set Partitions as Backbones in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1137/1.9781611973198.1openalex-snapshot
Triangle Listing Algorithms: Back from the Diversion
inferred← citeshttps://doi.org/10.1137/1.9781611974010.14openalex-snapshot
Tensor Spectral Clustering for Partitioning Higher-order Network Structures
inferred← citeshttps://doi.org/10.1137/1.9781611974782.116openalex-snapshot
A Hybrid Sampling Scheme for Triangle Counting
inferred← citeshttps://doi.org/10.1137/1.9781611976496.16openalex-snapshot
Hutch++: Optimal Stochastic Trace Estimation
inferred← citeshttps://doi.org/10.1137/1.9781611977561.ch7openalex-snapshot
Tailored vertex ordering for faster triangle listing in large graphs
inferred← citeshttps://doi.org/10.1137/13090729xopenalex-snapshot
Counting Triangles in Massive Graphs with MapReduce
inferred← citeshttps://doi.org/10.1137/18m1176701openalex-snapshot
On Approximating the Number of $k$-Cliques in Sublinear Time
inferred← citeshttps://doi.org/10.1145/1142351.1142388openalex-snapshot
Counting triangles in data streams
inferred← citeshttps://doi.org/10.1145/1401890.1401898openalex-snapshot
Efficient semi-streaming algorithms for local triangle counting in massive graphs
inferred← citeshttps://doi.org/10.1145/1536414.1536477openalex-snapshot
Finding, minimizing, and counting weighted subgraphs
inferred← citeshttps://doi.org/10.1145/1839490.1839494openalex-snapshot
Efficient algorithms for large-scale local triangle counting
inferred← citeshttps://doi.org/10.1145/2020408.2020513openalex-snapshot
Triangle listing in massive networks and its applications
inferred← citeshttps://doi.org/10.1145/2382577.2382581openalex-snapshot
Triangle listing in massive networks
inferred← citeshttps://doi.org/10.1145/2487575.2487678openalex-snapshot
A space efficient streaming algorithm for triangle counting using the birthday paradox
inferred← citeshttps://doi.org/10.1145/2505515.2505563openalex-snapshot
An efficient MapReduce algorithm for counting triangles in a very large graph
inferred← citeshttps://doi.org/10.1145/2505515.2505741openalex-snapshot
Parallel triangle counting in massive streaming graphs
inferred← citeshttps://doi.org/10.1145/2554797.2554819openalex-snapshot
Why do simple algorithms for triangle enumeration work in the real world?
inferred← citeshttps://doi.org/10.1145/2567634.2567635openalex-snapshot
Load balanced clustering coefficients
inferred← citeshttps://doi.org/10.1145/2659480.2659494openalex-snapshot
Fast In-Memory Triangle Listing for Large Real-World Graphs
inferred← citeshttps://doi.org/10.1145/2691190.2691193openalex-snapshot
I/O-Efficient Algorithms on Triangle Listing and Counting
inferred← citeshttps://doi.org/10.1145/2700395openalex-snapshot
A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox
inferred← citeshttps://doi.org/10.1145/2736277.2741640openalex-snapshot
Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions
inferred← citeshttps://doi.org/10.1145/2915516.2915521openalex-snapshot
A Comparative Study on Exact Triangle Counting Algorithms on the GPU
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018791openalex-snapshot
Internally Deterministic Parallelism: Techniques and Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018792openalex-snapshot
Deterministic Parallelism in Sequential Iterative Algorithms
inferred← citeshttps://doi.org/10.1145/3018787.3018793openalex-snapshot
A Deterministic Phase-Concurrent Parallel Hash Table
inferred← citeshttps://doi.org/10.1145/3018787.3018794openalex-snapshot
Priority Updates: A Contention-Reducing Primitive for Deterministic Programming
inferred← citeshttps://doi.org/10.1145/3018787.3018795openalex-snapshot
Ligra: A Lightweight Graph Processing Framework for Shared Memory
showing the first 199 of 298 · page through all 298
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.