On the public citation graph

Hypercube computing: Connected components

https://doi.org/10.1007/bf00127829
0 signed · 28 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/bf01939360openalex-snapshot
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
inferredcites →https://doi.org/10.1016/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1109/52.7944openalex-snapshot
Programming a hypercube multicomputer
inferredcites →https://doi.org/10.1109/sfcs.1985.52openalex-snapshot
Solving some graph problems with optimal or near-optimal speedup on mesh-of-trees networks
inferredcites →https://doi.org/10.1109/tc.1981.6312172openalex-snapshot
Data broadcasting in SIMD computers
inferredcites →https://doi.org/10.1109/tc.1986.5009434openalex-snapshot
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
inferredcites →https://doi.org/10.1137/0209058openalex-snapshot
Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
inferredcites →https://doi.org/10.1137/0210049openalex-snapshot
Parallel Matrix and Graph Algorithms
inferredcites →https://doi.org/10.1145/358080.358103openalex-snapshot
Anomalies in parallel branch-and-bound algorithms
inferredcites →https://doi.org/10.1145/359138.359141openalex-snapshot
Computing connected components on parallel computers
inferredcites →https://doi.org/10.1145/42411.42415openalex-snapshot
Reevaluating Amdahl's law

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.4330030205openalex-snapshot
Cluster Identification Algorithms for Spin Models — Sequential and Parallel
inferred← citeshttps://doi.org/10.1007/978-94-011-1679-4_13openalex-snapshot
Parallel Computing and Molecular Dynamics Simulations
inferred← citeshttps://doi.org/10.1007/bf01026593openalex-snapshot
A parallel multigrid algorithm for percolation clusters
inferred← citeshttps://doi.org/10.1016/0378-4371(95)00019-4openalex-snapshot
Parallel cluster labeling for large-scale Monte Carlo simulations
inferred← citeshttps://doi.org/10.1016/0920-5632(91)90884-hopenalex-snapshot
Parallel cluster algorithms
inferred← citeshttps://doi.org/10.1109/71.238626openalex-snapshot
The scalability of FFT on parallel computers
inferred← citeshttps://doi.org/10.1109/71.313122openalex-snapshot
Unstructured tree search on SIMD parallel computers
inferred← citeshttps://doi.org/10.1109/88.481664openalex-snapshot
Performance metrics: keeping the focus on runtime
inferred← citeshttps://doi.org/10.1109/ftdcs.1990.138333openalex-snapshot
Computing biconnected components on a hypercube
inferred← citeshttps://doi.org/10.1109/ipps.1992.223019openalex-snapshot
Evaluation of connected component labeling algorithms on shared and distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1109/tencon.1999.818667openalex-snapshot
Connected component labeling on a one dimensional DSP array
inferred← citeshttps://doi.org/10.1117/1.601713openalex-snapshot
Parallel image component labeling for target acquisition
inferred← citeshttps://doi.org/10.1145/181014.181021openalex-snapshot
A comparison of parallel algorithms for connected components
inferred← citeshttps://doi.org/10.35537/10915/2264openalex-snapshot
Procesamiento paralelo
inferred← citeshttps://doi.org/10.4018/978-1-4666-2065-0.ch021openalex-snapshot
A Grid and Cloud Based System for Data Grouping Computation and Online Service
inferred← citeshttps://doi.org/10.4018/jghpc.2011100104openalex-snapshot
A Grid and Cloud Based System for Data Grouping Computation and Online Service
inferred← citeshttps://doi.org/10.48550/arxiv.1507.02766openalex-snapshot
A Hybrid Graph-drawing Algorithm for Large, Naturally-clustered, Disconnected Graphs
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.