On the public citation graph

Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure

0 signed · 71 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.1002/1096-9128(200010)12:12<1131::aid-cpe528>3.0.co;2-2openalex-snapshot
Scalable parallel graph coloring algorithms
inferredcites →https://doi.org/10.1007/978-3-642-13193-6_35openalex-snapshot
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
inferredcites →https://doi.org/10.1007/978-3-642-14390-8_20openalex-snapshot
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_24openalex-snapshot
New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures
inferredcites →https://doi.org/10.1007/bf01383882openalex-snapshot
Practical parallel Union-Find algorithms for transitive closure and clustering
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.jpdc.2005.03.011openalex-snapshot
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
inferredcites →https://doi.org/10.1109/iiswc.2006.302741openalex-snapshot
DFS: A Simple to Write Yet Difficult to Execute Benchmark
inferredcites →https://doi.org/10.1145/103418.103458openalex-snapshot
Wait-free parallel algorithms for the union-find problem
inferredcites →https://doi.org/10.1145/1132952.1132954openalex-snapshot
Graph mining
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.4333openalex-snapshot
Work‐efficient parallel union‐find
inferred← citeshttps://doi.org/10.1007/978-3-030-10828-1_7openalex-snapshot
Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time
inferred← citeshttps://doi.org/10.1007/978-3-319-14325-5_14openalex-snapshot
Fast Parallel Connected Components Algorithms on GPUs
inferred← citeshttps://doi.org/10.1007/978-3-319-27308-2_44openalex-snapshot
Accelerating Minimum Spanning Forest Computations on Multicore Platforms
inferred← citeshttps://doi.org/10.1007/s41019-025-00287-wopenalex-snapshot
Hierarchical Isomerism Distributed Equivalent Union Find for Billion-Scale Disjoint Sets: A Case Study
inferred← citeshttps://doi.org/10.1016/j.ins.2021.06.044openalex-snapshot
Efficient implementation and parallelization of fuzzy density based clustering
inferred← citeshttps://doi.org/10.1016/j.parco.2017.09.002openalex-snapshot
Reprint of “A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications”
inferred← citeshttps://doi.org/10.1016/j.patrec.2019.11.039openalex-snapshot
Parallel connected-Component-Labeling based on homotopy trees
inferred← citeshttps://doi.org/10.1109/bigdata62323.2024.10825675openalex-snapshot
Fast Distributed Memory Parallel Algorithms for Finding Connected Components in Large Graphs
inferred← citeshttps://doi.org/10.1109/hipc.2018.00044openalex-snapshot
Parallel Read Partitioning for Concurrent Assembly of Metagenomic Data
inferred← citeshttps://doi.org/10.1109/hipc53243.2021.00021openalex-snapshot
Shared-memory implementation of the Karp-Sipser kernelization process
inferred← citeshttps://doi.org/10.1109/hpcc-smartcity-dss.2016.0037openalex-snapshot
Composable Locality Optimizations for Accelerating Parallel Forest Computations
inferred← citeshttps://doi.org/10.1109/icdm.2016.0053openalex-snapshot
Partition Aware Connected Component Computation in Distributed Systems
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00037openalex-snapshot
Communication-efficient Massively Distributed Connected Components
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.152openalex-snapshot
A New Parallel Algorithm for Two-Pass Connected Component Labeling
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.159openalex-snapshot
Parallel and Memory-Efficient Preprocessing for Metagenome Assembly
inferred← citeshttps://doi.org/10.1109/sc.2012.9openalex-snapshot
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure
inferred← citeshttps://doi.org/10.1109/sc.2014.51openalex-snapshot
Pardicle: Parallel Approximate Density-Based Clustering
inferred← citeshttps://doi.org/10.1109/tkde.2015.2419665openalex-snapshot
DSP-CC-: I/O Efficient Parallel Computation of Connected Components in Billion-Scale Networks
inferred← citeshttps://doi.org/10.1109/tpds.2017.2672739openalex-snapshot
An Adaptive Parallel Algorithm for Computing Connected Components
inferred← citeshttps://doi.org/10.1109/tsp.2019.2957638openalex-snapshot
Computationally Efficient Distributed Multi-Sensor Fusion With Multi-Bernoulli Filter
inferred← citeshttps://doi.org/10.1137/15m1021325openalex-snapshot
A Parallel Edge Orientation Algorithm for Quadrilateral Meshes
inferred← citeshttps://doi.org/10.1142/s0129626421500213openalex-snapshot
Graph connectivity in log steps using label propagation
inferred← citeshttps://doi.org/10.1145/2442516.2442530openalex-snapshot
Ligra
inferred← citeshttps://doi.org/10.1145/2503210.2503255openalex-snapshot
Scalable parallel OPTICS data clustering using graph algorithmic techniques
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/2807591.2807619openalex-snapshot
A parallel connectivity algorithm for de Bruijn graphs in metagenomic applications
inferred← citeshttps://doi.org/10.1145/2807591.2807651openalex-snapshot
A work-efficient algorithm for parallel unordered depth-first search
inferred← citeshttps://doi.org/10.1145/3018787openalex-snapshot
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
inferred← citeshttps://doi.org/10.1145/3018787.3018788openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1145/3018787.3018789openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1145/3018787.3018790openalex-snapshot
Preliminaries and Notation
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/3018787.3018803openalex-snapshot
Conclusion and Future Work
inferred← citeshttps://doi.org/10.1145/3018787.3018804openalex-snapshot
References
inferred← citeshttps://doi.org/10.1145/3159652.3159696openalex-snapshot
Shortcutting Label Propagation for Distributed Connected Components
inferred← citeshttps://doi.org/10.1145/3208040.3208041openalex-snapshot
A high-performance connected components implementation for GPUs
inferred← citeshttps://doi.org/10.1145/3210377.3210414openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferred← citeshttps://doi.org/10.1145/3309697.3331503openalex-snapshot
Efficient Distributed Workload (Re-)Embedding
inferred← citeshttps://doi.org/10.1145/3322205.3311084openalex-snapshot
Efficient Distributed Workload (Re-)Embedding
inferred← citeshttps://doi.org/10.1145/3376930.3376959openalex-snapshot
Efficient DistributedWorkload (Re-)Embedding
inferred← citeshttps://doi.org/10.1145/3581784.3607071openalex-snapshot
A GPU Algorithm for Detecting Strongly Connected Components
inferred← citeshttps://doi.org/10.1145/3803020openalex-snapshot
FastCC: A System-Algorithm Co-Design for Connected Components Computation on Large Power-Law Graphs
inferred← citeshttps://doi.org/10.1371/journal.pone.0229936openalex-snapshot
PACC: Large scale connected component computation on Hadoop and Spark
inferred← citeshttps://doi.org/10.14778/3436905.3436923openalex-snapshot
ConnectIt
inferred← citeshttps://doi.org/10.4018/978-1-7998-7156-9.ch005openalex-snapshot
Paradigms for Effective Parallelization of Inherently Sequential Graph Algorithms on Multi-Core Architectures
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06156openalex-snapshot
An Adaptive Parallel Algorithm for Computing Connected Components
inferred← citeshttps://doi.org/10.48550/arxiv.1709.09099openalex-snapshot
PMV: Pre-partitioned Generalized Matrix-Vector Multiplication for Scalable Graph Mining
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.