On the public citation graph
Parallel algorithms for connected components in a graph
0 signed · 46 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.1016/0020-0190(82)90093-xopenalex-snapshot
Parallel computation and conflicts in memory access
inferredcites →https://doi.org/10.1016/0020-0190(82)90131-4openalex-snapshot
Parallel algorithms for the connected components and minimal spanning tree problems
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/s0022-0000(73)80043-1openalex-snapshot
Optimal algorithms for parallel polynomial evaluation
inferredcites →https://doi.org/10.1109/sfcs.1984.715896openalex-snapshot
Finding biconnected componemts and computing tree functions in logarithmic parallel time
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0207020openalex-snapshot
Parallel Computations in Graph Theory
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/800113.803631openalex-snapshot
Parallel algorithms for the transitive closure and the connected component problems
inferredcites →https://doi.org/10.2307/2282945openalex-snapshot
Programming, Games and Transportation Networks.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-7091-9076-0_4openalex-snapshot
Basic Parallel Algorithms in Graph Theory
inferred← citeshttps://doi.org/10.1007/bfb0016262openalex-snapshot
Some improved parallelisms for graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90034-fopenalex-snapshot
Optimal parallel algorithms on planar graphs
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90019-xopenalex-snapshot
Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms
inferred← citeshttps://doi.org/10.1109/31.1744openalex-snapshot
Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model
inferred← citeshttps://doi.org/10.1109/ipdps.2013.101openalex-snapshot
Deploying Graph Algorithms on GPUs: An Adaptive Solution
inferred← citeshttps://doi.org/10.1145/2612669.2612692openalex-snapshot
A simple and practical linear-work parallel algorithm for connectivity
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
inferred← citeshttps://doi.org/10.1145/3018787.3018796openalex-snapshot
Ligra+: Adding Compression to Ligra
inferred← citeshttps://doi.org/10.1145/3018787.3018797openalex-snapshot
Linear-Work Parallel Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3018787.3018798openalex-snapshot
Parallel and Cache-Oblivious Triangle Computations
inferred← citeshttps://doi.org/10.1145/3018787.3018799openalex-snapshot
Parallel Cartesian Tree and Suffix Tree Construction
inferred← citeshttps://doi.org/10.1145/3018787.3018800openalex-snapshot
Parallel Computation of Longest Common Prefixes
inferred← citeshttps://doi.org/10.1145/3018787.3018801openalex-snapshot
Parallel Lempel-Ziv Factorization
inferred← citeshttps://doi.org/10.1145/3018787.3018802openalex-snapshot
Parallel Wavelet Tree Construction
inferred← citeshttps://doi.org/10.1145/3159652.3159696openalex-snapshot
Shortcutting Label Propagation for Distributed Connected Components
inferred← citeshttps://doi.org/10.1145/3410463.3414657openalex-snapshot
Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
inferred← citeshttps://doi.org/10.48550/arxiv.2008.03909openalex-snapshot
ConnectIt: A Framework for Static and Incremental Parallel Graph Connectivity Algorithms
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.