On the public citation graph

Triangle Centrality

https://doi.org/10.1145/3685677
0 signed · 76 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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/978-3-642-20847-8_2openalex-snapshot
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
inferredcites →https://doi.org/10.1007/978-3-642-25591-5_39openalex-snapshot
Sorting, Searching, and Simulation in the MapReduce Framework
inferredcites →https://doi.org/10.1007/s00265-003-0651-yopenalex-snapshot
The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations
inferredcites →https://doi.org/10.1007/s10588-006-7084-xopenalex-snapshot
Identifying sets of key players in a social network
inferredcites →https://doi.org/10.1007/s11227-020-03181-6openalex-snapshot
Distributed non-negative matrix factorization with determination of the number of latent features
inferredcites →https://doi.org/10.1007/s13278-018-0493-2openalex-snapshot
Study on centrality measures in social networks: a survey
inferredcites →https://doi.org/10.1016/0378-8733(78)90021-7openalex-snapshot
Centrality in social networks conceptual clarification
inferredcites →https://doi.org/10.1016/j.socnet.2004.11.008openalex-snapshot
Centrality and network flow
inferredcites →https://doi.org/10.1016/j.socnet.2005.11.005openalex-snapshot
A Graph-theoretic perspective on centrality
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.1016/s0169-7552(98)00110-xopenalex-snapshot
The anatomy of a large-scale hypertextual Web search engine
inferredcites →https://doi.org/10.1038/30918openalex-snapshot
Collective dynamics of ‘small-world’ networks
inferredcites →https://doi.org/10.1073/pnas.012582999openalex-snapshot
Random graph models of social networks
inferredcites →https://doi.org/10.1073/pnas.122653799openalex-snapshot
Community structure in social and biological networks
inferredcites →https://doi.org/10.1073/pnas.98.2.404openalex-snapshot
The structure of scientific collaboration networks
inferredcites →https://doi.org/10.1080/0022250x.1972.9989806openalex-snapshot
Factoring and weighting approaches to status scores and clique identification
inferredcites →https://doi.org/10.1080/0022250x.1979.9989889openalex-snapshot
Matrix measures for transitivity and balance*
inferredcites →https://doi.org/10.1080/0022250x.2001.9990249openalex-snapshot
A faster algorithm for betweenness centrality*
inferredcites →https://doi.org/10.1080/00223980.1954.9712925openalex-snapshot
Group Structure and the Behavior of Individuals in Small Groups
inferredcites →https://doi.org/10.1086/jar.33.4.3629752openalex-snapshot
An Information Flow Model for Conflict and Fission in Small Groups
inferredcites →https://doi.org/10.1088/1742-5468/2009/11/p11013openalex-snapshot
Detecting overlapping community structure of networks based on vertex–vertex correlations
inferredcites →https://doi.org/10.1093/acprof:oso/9780199206650.001.0001openalex-snapshot
Networks: An Introduction
inferredcites →https://doi.org/10.1098/rsbl.2004.0225openalex-snapshot
Identifying the role that animals play in their social networks
inferredcites →https://doi.org/10.1103/physreve.68.036122openalex-snapshot
Why social networks are different from other types of networks
inferredcites →https://doi.org/10.1103/physreve.74.036104openalex-snapshot
Finding community structure in networks using the eigenvectors of matrices
inferredcites →https://doi.org/10.1109/hpec.2015.7396313openalex-snapshot
A cloud-based approach to big graphs
inferredcites →https://doi.org/10.1109/hpec.2018.8547538openalex-snapshot
Graph algorithms via SuiteSparse: GraphBLAS: triangle counting and K-truss
inferredcites →https://doi.org/10.1109/ipdps.2017.76openalex-snapshot
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm
inferredcites →https://doi.org/10.1109/ipdpsw.2015.77openalex-snapshot
Fast Sparse Matrix and Sparse Vector Multiplication Algorithm on the GPU
inferredcites →https://doi.org/10.1109/ipdpsw.2017.117openalex-snapshot
Design of the GraphBLAS API for C
inferredcites →https://doi.org/10.1109/mcse.2009.120openalex-snapshot
Graph Twiddling in a MapReduce World
inferredcites →https://doi.org/10.1109/mcsi.2014.40openalex-snapshot
Reformulating a Breadth-First Search Algorithm on an Undirected Graph in the Language of Linear Algebra
inferredcites →https://doi.org/10.1109/passat/socialcom.2011.169openalex-snapshot
Triangles to Capture Social Cohesion
inferredcites →https://doi.org/10.1109/tkde.2019.2892096openalex-snapshot
Scalable Spectral Clustering for Overlapping Community Detection in Large-Scale Networks
inferredcites →https://doi.org/10.1111/j.1467-9450.1974.tb00598.xopenalex-snapshot
On the centrality in a graph
inferredcites →https://doi.org/10.1121/1.1906679openalex-snapshot
Communication Patterns in Task-Oriented Groups
inferredcites →https://doi.org/10.1137/0214017openalex-snapshot
Arboricity and Subgraph Listing Algorithms
inferredcites →https://doi.org/10.1137/0217049openalex-snapshot
Parallel Merge Sort
inferredcites →https://doi.org/10.1137/1.9780898719918openalex-snapshot
Graph Algorithms in the Language of Linear Algebra
inferredcites →https://doi.org/10.1137/1.9781611973198.1openalex-snapshot
Triangle Listing Algorithms: Back from the Diversion
inferredcites →https://doi.org/10.1137/1.9781611974010.105openalex-snapshot
Non-exhaustive, Overlapping k-means
inferredcites →https://doi.org/10.1137/1.9781611976465.32openalex-snapshot
A Refined Laser Method and Faster Matrix Multiplication
inferredcites →https://doi.org/10.1137/13090729xopenalex-snapshot
Counting Triangles in Massive Graphs with MapReduce
inferredcites →https://doi.org/10.1145/1077464.1077466openalex-snapshot
Fast sparse matrix multiplication
inferredcites →https://doi.org/10.1145/1134271.1134277openalex-snapshot
The political blogosphere and the 2004 U.S. election
inferredcites →https://doi.org/10.1145/1557019.1557111openalex-snapshot
DOULION
inferredcites →https://doi.org/10.1145/1807167.1807222openalex-snapshot
Efficient parallel set-similarity joins using MapReduce
inferredcites →https://doi.org/10.1145/2020408.2020513openalex-snapshot
Triangle listing in massive networks and its applications
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/2304576.2304607openalex-snapshot
Space-round tradeoffs for MapReduce computations
inferredcites →https://doi.org/10.1145/2382577.2382581openalex-snapshot
Triangle listing in massive networks
inferredcites →https://doi.org/10.1145/3210377.3210386openalex-snapshot
Greedy and Local Ratio Algorithms in the MapReduce Model
inferredcites →https://doi.org/10.1145/3225058.3225122openalex-snapshot
Implementing Push-Pull Efficiently in GraphBLAS
inferredcites →https://doi.org/10.1145/3322125openalex-snapshot
Algorithm 1000
inferredcites →https://doi.org/10.1145/3446216openalex-snapshot
Optimal Algebraic Breadth-First Search for Sparse Graphs
inferredcites →https://doi.org/10.1145/3466795openalex-snapshot
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
inferredcites →https://doi.org/10.1145/800133.804339openalex-snapshot
Parallelism in random access machines
inferredcites →https://doi.org/10.1145/828.1884openalex-snapshot
Storing a Sparse Table with 0 (1) Worst Case Access Time
inferredcites →https://doi.org/10.1177/1473871616666393openalex-snapshot
Graphing trillions of triangles
inferredcites →https://doi.org/10.21276/ijre.2018.5.5.4openalex-snapshot
MapReduce: Simplified Data Processing on Large Cluster
inferredcites →https://doi.org/10.2307/3033543openalex-snapshot
A Set of Measures of Centrality Based on Betweenness
inferredcites →https://doi.org/10.5169/seals-266440openalex-snapshot
Distribution de la flore alpine dans le Bassin des Dranses et dans quelques régions voisines
inferredcites →https://doi.org/10.5210/fm.v7i4.941openalex-snapshot
Uncloaking Terrorist Networks
inferredcites →https://doi.org/10.56021/9781421407944openalex-snapshot
Matrix Computations
inferredcites →https://doi.org/10.7155/jgaa.00527openalex-snapshot
Bounds and algorithms for graph trusses

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.chaos.2026.119191openalex-snapshot
An α-triangle eigenvector centrality of graphs
inferred← citeshttps://doi.org/10.1016/j.inffus.2025.103705openalex-snapshot
EISH: Extended identifying technique of influential spreaders for influence maximization using contribution rate based on structural holes and non-structural holes
inferred← citeshttps://doi.org/10.1016/j.ins.2026.123253openalex-snapshot
The subgraph eigenvector centrality of graphs
inferred← citeshttps://doi.org/10.1016/j.jik.2025.100778openalex-snapshot
NEON as a navigator of energy open innovation ecosystems
inferred← citeshttps://doi.org/10.1016/j.physa.2026.131416openalex-snapshot
TripRank: A centrality metric based on dynamic competition of geometric–topological structures for influential nodes identification
inferred← citeshttps://doi.org/10.1109/bigdia71496.2026.11684712openalex-snapshot
ESTG: Entropy-Weighted Semi-Global Triangle Centrality and Directed Resistance Distance for Identifying Influential Nodes
inferred← citeshttps://doi.org/10.1109/ccgrid59990.2024.00080openalex-snapshot
A Distributed, Asynchronous Algorithm for Large-Scale Internet Network Topology Analysis
inferred← citeshttps://doi.org/10.1109/tnse.2026.3704047openalex-snapshot
Multiplex Hypergraph Contrastive Learning for Identifying Critical Workflows in Cross-Domain Business Collaboration
inferred← citeshttps://doi.org/10.1109/tpec63981.2025.10907222openalex-snapshot
Analyzing Power Grid Structure with Triangle Centrality Metrics
inferred← citeshttps://doi.org/10.3390/a18110685openalex-snapshot
Cover Edge-Based Novel Triangle Counting
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.