On the public citation graph
Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform
0 signed · 36 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/11558958_130openalex-snapshot
Speeding up Parallel Graph Coloring
inferredcites →https://doi.org/10.1007/11945918_55openalex-snapshot
A Study on the Locality Behavior of Minimum Spanning Tree Algorithms
inferredcites →https://doi.org/10.1007/3-540-48518-x_3openalex-snapshot
Designing Practical Efficient Algorithms for Symmetric Multiprocessors
inferredcites →https://doi.org/10.1007/978-3-540-77004-6_10openalex-snapshot
Approximating Betweenness Centrality
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/j.ipl.2008.04.009openalex-snapshot
Consecutive block minimization is 1.5-approximable
inferredcites →https://doi.org/10.1016/j.jpdc.2006.06.001openalex-snapshot
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
inferredcites →https://doi.org/10.1016/j.parco.2008.12.006openalex-snapshot
Optimization of sparse matrix-vector multiplication on emerging multicore platforms
inferredcites →https://doi.org/10.1038/35075138openalex-snapshot
Lethality and centrality in protein networks
inferredcites →https://doi.org/10.1073/pnas.202301299openalex-snapshot
Classification of scale-free networks
inferredcites →https://doi.org/10.1109/icpp.2005.55openalex-snapshot
On the Architectural Requirements for Efficient Execution of Graph Algorithms
inferredcites →https://doi.org/10.1109/ipdps.2010.5470354openalex-snapshot
Oblivious algorithms for multicores and network of processors
inferredcites →https://doi.org/10.1109/sc.2010.26openalex-snapshot
Fast PGAS Implementation of Distributed Graph Algorithms
inferredcites →https://doi.org/10.1109/sfcs.1985.9openalex-snapshot
An optimal parallel algorithm for integer sorting
inferredcites →https://doi.org/10.1126/science.286.5439.509openalex-snapshot
Emergence of Scaling in Random Networks
inferredcites →https://doi.org/10.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0219047openalex-snapshot
Planar Depth-First Search in $O(\log n)$ Parallel Time
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/276698.276716openalex-snapshot
Approximating the bandwidth via volume respecting embeddings (extended abstract)
inferredcites →https://doi.org/10.1145/316194.316229openalex-snapshot
On power-law relationships of the Internet topology
inferredcites →https://doi.org/10.1145/509948.509950openalex-snapshot
Cache-oblivious priority queue and graph algorithm applications
inferredcites →https://doi.org/10.1145/73007.73035openalex-snapshot
Parallel depth-first search in general directed graphs
inferredcites →https://doi.org/10.1145/782814.782836openalex-snapshot
Estimating cache misses and locality using stack distances
inferredcites →https://doi.org/10.2307/3033543openalex-snapshot
A Set of Measures of Centrality Based on Betweenness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/mascots.2016.66openalex-snapshot
Parallel Graph Processing on Modern Multi-core Servers: New Findings and Remaining Challenges
inferred← citeshttps://doi.org/10.1109/sbac-pad.2015.19openalex-snapshot
Memory Centric Computation (Mc2) for Large-Scale Graph Processing
inferred← citeshttps://doi.org/10.1109/tpds.2014.2372755openalex-snapshot
Scalable Multicore k-NN Search via Subspace Clustering for Filtering
inferred← citeshttps://doi.org/10.1137/1.9781611972832.76openalex-snapshot
Shattering and Compressing Networks for Betweenness Centrality
inferred← citeshttps://doi.org/10.1145/2851141.2851154openalex-snapshot
Articulation points guided redundancy elimination for betweenness centrality
inferred← citeshttps://doi.org/10.1145/3016078.2851154openalex-snapshot
Articulation points guided redundancy elimination for betweenness centrality
inferred← citeshttps://doi.org/10.14778/2824032.2824041openalex-snapshot
Bonding vertex sets over distributed graph
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.