On the public citation graph

An o(n) work EREW parallel algorithm for updating MST

https://doi.org/10.1007/bfb0049420
0 signed · 25 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/3-540-58184-7_143openalex-snapshot
Batch dynamic algorithms for two graph problems
inferredcites →https://doi.org/10.1007/bf01228509openalex-snapshot
Optimal parallel algorithms for multiple updates of minimum spanning trees
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0020-0190(86)90098-0openalex-snapshot
An O(log n) algorithm for parallel update of minimum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(88)90084-1openalex-snapshot
Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(84)90003-5openalex-snapshot
Finding Euler tours in parallel
inferredcites →https://doi.org/10.1109/ipps.1993.262898openalex-snapshot
A parallel algorithm for multiple edge updates of minimum spanning trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1145/140901.141917openalex-snapshot
A parallel algorithm for computing minimum spanning trees
inferredcites →https://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1995.1157openalex-snapshot
A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_59openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
inferred← citeshttps://doi.org/10.1109/71.946661openalex-snapshot
Fully dynamic maintenance of k-connectivity in parallel
inferred← citeshttps://doi.org/10.1109/icde65448.2025.00019openalex-snapshot
Preserving K-Connectivity in Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/ipps.1995.395919openalex-snapshot
An EREW PRAM fully-dynamic algorithm for MST
inferred← citeshttps://doi.org/10.1109/spdp.1995.530687openalex-snapshot
Fully dynamic maintaining 2-edge connectivity in parallel
inferred← citeshttps://doi.org/10.1137/1.9781611976489.10openalex-snapshot
Parallel Batch-Dynamic k -Clique Counting
inferred← citeshttps://doi.org/10.1137/110832689openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
inferred← citeshttps://doi.org/10.1145/3210377.3210403openalex-snapshot
Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest
inferred← citeshttps://doi.org/10.1145/3323165.3323196openalex-snapshot
Parallel Batch-Dynamic Graph Connectivity
inferred← citeshttps://doi.org/10.1145/3350755.3400241openalex-snapshot
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model
inferred← citeshttps://doi.org/10.48550/arxiv.1102.4866openalex-snapshot
The MST of Symmetric Disk Graphs (in Arbitrary Metrics) is Light
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.