On the public citation graph

Parallel Strong Connectivity Based on Faster Reachability

https://doi.org/10.1145/3589259
0 signed · 92 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.1006/jagm.1996.0813openalex-snapshot
Using Selective Path-Doubling for Parallel Shortest-Path Computations
inferredcites →https://doi.org/10.1006/jagm.1997.0888openalex-snapshot
A Randomized Parallel Algorithm for Single-Source Shortest Paths
inferredcites →https://doi.org/10.1006/jagm.1998.0968openalex-snapshot
Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot
Size-Estimation Framework with Applications to Transitive Closure and Reachability
inferredcites →https://doi.org/10.1006/jcss.2002.1883openalex-snapshot
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
inferredcites →https://doi.org/10.1007/11575832_14openalex-snapshot
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
inferredcites →https://doi.org/10.1007/3-540-45591-4_68openalex-snapshot
On Identifying Strongly Connected Components in Parallel
inferredcites →https://doi.org/10.1007/978-1-349-13908-8_1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-030-22747-0_2openalex-snapshot
Parallel Strongly Connected Components Detection with Multi-partition on GPUs
inferredcites →https://doi.org/10.1007/978-3-642-13818-8_11openalex-snapshot
Scalable Clustering Algorithm for N-Body Simulations in a Shared-Nothing Cluster
inferredcites →https://doi.org/10.1007/978-3-642-15992-3_29openalex-snapshot
Navigating K-Nearest Neighbor Graphs to Solve Nearest Neighbor Searches
inferredcites →https://doi.org/10.1007/s00446-012-0157-9openalex-snapshot
Efficient distributed approximation algorithms via probabilistic tree embeddings
inferredcites →https://doi.org/10.1007/s10009-015-0382-1openalex-snapshot
Concurrent depth-first search algorithms based on Tarjan’s Algorithm
inferredcites →https://doi.org/10.1007/s10115-013-0693-zopenalex-snapshot
Defining and evaluating network communities based on ground-truth
inferredcites →https://doi.org/10.1007/s11227-010-0405-3openalex-snapshot
The Cilk++ concurrency platform
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/j.jpdc.2005.03.007openalex-snapshot
Finding strongly connected components in distributed graphs
inferredcites →https://doi.org/10.1016/j.knosys.2018.02.038openalex-snapshot
Finding strongly connected components of simple digraphs based on generalized rough sets theory
inferredcites →https://doi.org/10.1016/j.neucom.2022.08.029openalex-snapshot
A robust clustering method with noise identification based on directed K-nearest neighbor graph
inferredcites →https://doi.org/10.1016/j.snb.2015.03.028openalex-snapshot
Reservoir computing compensates slow response of chemosensor arrays exposed to fast varying gas concentrations in continuous monitoring
inferredcites →https://doi.org/10.1016/j.sysarc.2013.10.014openalex-snapshot
Efficient decomposition of strongly connected components on GPUs
inferredcites →https://doi.org/10.1016/j.tcs.2009.01.009openalex-snapshot
Optimal construction of k -nearest-neighbor graphs for identifying noisy clusters
inferredcites →https://doi.org/10.1016/s0898-1221(99)90441-8openalex-snapshot
Introduction to parallel algorithms
inferredcites →https://doi.org/10.1073/pnas.1914628117openalex-snapshot
Fibration symmetries uncover the building blocks of biological networks
inferredcites →https://doi.org/10.1093/logcom/exp003openalex-snapshot
Distributed Algorithms for SCC Decomposition
inferredcites →https://doi.org/10.1103/physreve.98.062116openalex-snapshot
Percolation on an isotropically directed lattice
inferredcites →https://doi.org/10.1109/2.781637openalex-snapshot
Chameleon: hierarchical clustering using dynamic modeling
inferredcites →https://doi.org/10.1109/dcc.2002.999950openalex-snapshot
The Link Database: fast access to graphs of the Web
inferredcites →https://doi.org/10.1109/focs.2018.00070openalex-snapshot
Parallel Graph Connectivity in Log Diameter Rounds
inferredcites →https://doi.org/10.1109/icde.2009.129openalex-snapshot
Topologically Sorted Skylines for Partially Ordered Domains
inferredcites →https://doi.org/10.1109/icdmw.2018.00159openalex-snapshot
High Dimensional Clustering: A Strongly Connected Component Clustering Solution (SCCC)
inferredcites →https://doi.org/10.1109/icicict1.2017.8342664openalex-snapshot
KNN-DBSCAN: Using k-nearest neighbor information for parameter-free density based clustering
inferredcites →https://doi.org/10.1109/icpr.2004.1334558openalex-snapshot
Outlier detection using k-nearest neighbour graph
inferredcites →https://doi.org/10.1109/ipdps.2011.59openalex-snapshot
Computing Strongly Connected Components in Parallel on CUDA
inferredcites →https://doi.org/10.1109/ipdps.2014.64openalex-snapshot
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems
inferredcites →https://doi.org/10.1109/ipdps.2018.00012openalex-snapshot
Optimizing Parallel Graph Connectivity Computation via Subgraph Sampling
inferredcites →https://doi.org/10.1109/sc.2012.50openalex-snapshot
Direction-optimizing Breadth-First Search
inferredcites →https://doi.org/10.1109/sc.2018.00061openalex-snapshot
iSpan: Parallel Identification of Strongly Connected Components with Spanning Trees
inferredcites →https://doi.org/10.1109/tpami.2006.227openalex-snapshot
Fast Agglomerative Clustering Using a k-Nearest Neighbor Graph
inferredcites →https://doi.org/10.1109/tpds.2017.2672739openalex-snapshot
An Adaptive Parallel Algorithm for Computing Connected Components
inferredcites →https://doi.org/10.1111/j.0030-1299.2005.13082.xopenalex-snapshot
Ecological subsystems via graph theory: the role of strongly connected components
inferredcites →https://doi.org/10.1126/science.290.5500.2319openalex-snapshot
A Global Geometric Framework for Nonlinear Dimensionality Reduction
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0220006openalex-snapshot
High-Probability Parallel Transitive-Closure Algorithms
inferredcites →https://doi.org/10.1137/060650271openalex-snapshot
Improved Dynamic Reachability Algorithms for Directed Graphs
inferredcites →https://doi.org/10.1137/1.9781611976489.6openalex-snapshot
The Read-Only Semi-External Model
inferredcites →https://doi.org/10.1145/1150402.1150412openalex-snapshot
Group formation in large social networks
inferredcites →https://doi.org/10.1145/1298306.1298311openalex-snapshot
Measurement and analysis of online social networks
inferredcites →https://doi.org/10.1145/1367497.1367532openalex-snapshot
Learning transportation mode from raw gps data for geographic applications on the web
inferredcites →https://doi.org/10.1145/1378533.1378560openalex-snapshot
Finding strongly connected components in parallel using O (log 2 n ) reachability queries
inferredcites →https://doi.org/10.1145/1557019.1557047openalex-snapshot
Efficient influence maximization in social networks
inferredcites →https://doi.org/10.1145/1772690.1772751openalex-snapshot
What is Twitter, a social network or a news media?
inferredcites →https://doi.org/10.1145/1807167.1807184openalex-snapshot
Pregel
inferredcites →https://doi.org/10.1145/2145816.2145840openalex-snapshot
Internally deterministic parallel algorithms can be fast
inferredcites →https://doi.org/10.1145/2463676.2465286openalex-snapshot
TF-Label
inferredcites →https://doi.org/10.1145/2486159.2486180openalex-snapshot
Parallel graph decompositions using random shifts
inferredcites →https://doi.org/10.1145/2503210.2503246openalex-snapshot
On fast parallel detection of strongly connected components (SCC) in small-world graphs
inferredcites →https://doi.org/10.1145/2517349.2522739openalex-snapshot
A lightweight infrastructure for graph analytics
inferredcites →https://doi.org/10.1145/2555243.2555286openalex-snapshot
SCCMulti
inferredcites →https://doi.org/10.1145/2612669.2612687openalex-snapshot
Phase-concurrent hash tables for determinism
inferredcites →https://doi.org/10.1145/2612669.2612692openalex-snapshot
A simple and practical linear-work parallel algorithm for connectivity
inferredcites →https://doi.org/10.1145/2807591.2807651openalex-snapshot
A work-efficient algorithm for parallel unordered depth-first search
inferredcites →https://doi.org/10.1145/2884045.2884048openalex-snapshot
GPU centric extensions for parallel strongly connected components computation
inferredcites →https://doi.org/10.1145/3026937.3026941openalex-snapshot
High Performance Detection of Strongly Connected Components in Sparse Graphs on GPUs
inferredcites →https://doi.org/10.1145/3087556.3087580openalex-snapshot
Julienne
inferredcites →https://doi.org/10.1145/3276491openalex-snapshot
GraphIt: a high-performance graph DSL
inferredcites →https://doi.org/10.1145/3293611.3331593openalex-snapshot
Randomized Concurrent Set Union and Generalized Wake-Up
inferredcites →https://doi.org/10.1145/3293883.3295725openalex-snapshot
Provably and practically efficient granularity control
inferredcites →https://doi.org/10.1145/3350755.3400222openalex-snapshot
Improved Work Span Tradeoff for Single Source Reachability and Approximate Shortest Paths
inferredcites →https://doi.org/10.1145/3350755.3400227openalex-snapshot
Optimal Parallel Algorithms in the Binary-Forking Model
inferredcites →https://doi.org/10.1145/3350755.3400254openalex-snapshot
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines
inferredcites →https://doi.org/10.1145/3398682.3399168openalex-snapshot
The Graph Based Benchmark Suite (GBBS)
inferredcites →https://doi.org/10.1145/3402819openalex-snapshot
Parallelism in Randomized Incremental Algorithms
inferredcites →https://doi.org/10.1145/3434393openalex-snapshot
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
inferredcites →https://doi.org/10.1145/3469379.3469384openalex-snapshot
GeoGraph
inferredcites →https://doi.org/10.1145/358438.349325openalex-snapshot
Symbolic bounds analysis of pointers, array indices, and accessed memory regions
inferredcites →https://doi.org/10.14778/1920841.1920986openalex-snapshot
Graph homomorphism revisited for graph matching
inferredcites →https://doi.org/10.14778/2732286.2732294openalex-snapshot
Optimizing graph algorithms on pregel-like systems
inferredcites →https://doi.org/10.14778/2733085.2733089openalex-snapshot
Pregel algorithms for graph connectivity problems with performance guarantees
inferredcites →https://doi.org/10.14778/3436905.3436923openalex-snapshot
ConnectIt
inferredcites →https://doi.org/10.1609/aaai.v28i1.8726openalex-snapshot
Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations

What points at this work

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

inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00080openalex-snapshot
Teaching Parallel Algorithms Using the Binary-Forking Model
inferred← citeshttps://doi.org/10.1145/3597635.3598017openalex-snapshot
Parallel Strong Connectivity Based on Faster Reachability (Abstract)
inferred← citeshttps://doi.org/10.1145/3694906.3743350openalex-snapshot
A Deterministic Work-Depth Tradeoff for Strongly Connected Components
inferred← citeshttps://doi.org/10.1145/3711708openalex-snapshot
Proceedings of the 1st FastCode Programming Challenge
inferred← citeshttps://doi.org/10.1145/3711708.3723444openalex-snapshot
BFSBlitz: A Highly Parallel Graph System for Breadth-First Search
inferred← citeshttps://doi.org/10.1145/3711708.3723447openalex-snapshot
Hyb-Stepping: Hybrid Stepping for Parallel Shortest Paths
inferred← citeshttps://doi.org/10.1145/3711708.3723451openalex-snapshot
Parallel Breadth-First Search Optimization Strategies
inferred← citeshttps://doi.org/10.1145/3712285.3759872openalex-snapshot
Wasp: Efficient Asynchronous Single-Source Shortest Path on Multicore Systems via Work Stealing
inferred← citeshttps://doi.org/10.1145/3721145.3725744openalex-snapshot
Parallel Contraction Hierarchies Can Be Efficient and Scalable
inferred← citeshttps://doi.org/10.2139/ssrn.6277055openalex-snapshot
Fast-SCC: A Fast Parallel Strong Connectivity Component Algorithm via Identifying Fake-link Subgraphs
inferred← citeshttps://doi.org/10.65148/ecn/2025018openalex-snapshot
Optimizing Graph Traversal Efficiency Using the Novel ALGO-X Framework for Theoretical and Experimental Analysis
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.