On the public citation graph

Optimal parallel algorithms for multiple updates of minimum spanning trees

https://doi.org/10.1007/bf01228509
0 signed · 39 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/3-540-16761-7_92openalex-snapshot
A parallel vertex insertion algorithm for minimum spanning trees
inferredcites →https://doi.org/10.1007/978-1-4684-5511-3_9openalex-snapshot
Optimal Tree Contraction in the EREW Model
inferredcites →https://doi.org/10.1007/bf01762121openalex-snapshot
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
inferredcites →https://doi.org/10.1007/bf01840376openalex-snapshot
Efficient parallel algorithms for graph problems
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)90020-8openalex-snapshot
On handling vertex deletion in 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/0196-6774(82)90008-6openalex-snapshot
An O(logn) parallel connectivity algorithm
inferredcites →https://doi.org/10.1016/0304-3975(88)90035-7openalex-snapshot
An efficient parallel algorithm for updating minimum spanning trees
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
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.1109/sfcs.1985.43openalex-snapshot
Parallel tree contraction and its application
inferredcites →https://doi.org/10.1137/0204032openalex-snapshot
On Finding and Updating Spanning Trees and Shortest Paths
inferredcites →https://doi.org/10.1137/0210051openalex-snapshot
Fast, Efficient Parallel Algorithms for Some Graph Problems
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.1137/0214061openalex-snapshot
An Efficient Parallel Biconnectivity Algorithm
inferredcites →https://doi.org/10.1137/0217009openalex-snapshot
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
inferredcites →https://doi.org/10.1137/0218041openalex-snapshot
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
inferredcites →https://doi.org/10.1145/358628.358650openalex-snapshot
Efficient parallel algorithms for some graph problems
inferredcites →https://doi.org/10.21236/ada150497openalex-snapshot
Parallel Update of Minimum Spanning Trees in Logarithmic Time.

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/11535294_14openalex-snapshot
Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_143openalex-snapshot
Batch dynamic algorithms for two graph problems
inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_12openalex-snapshot
Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/bf01944354openalex-snapshot
Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
inferred← citeshttps://doi.org/10.1007/bfb0049420openalex-snapshot
An o(n) work EREW parallel algorithm for updating MST
inferred← citeshttps://doi.org/10.1007/s10559-006-0035-1openalex-snapshot
Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph
inferred← citeshttps://doi.org/10.1109/ipps.1992.223028openalex-snapshot
Optimal algorithms for the vertex updating problem of a minimum spanning tree
inferred← citeshttps://doi.org/10.1109/ipps.1993.262898openalex-snapshot
A parallel algorithm for multiple edge updates of minimum spanning trees
inferred← citeshttps://doi.org/10.1109/ipps.1995.395919openalex-snapshot
An EREW PRAM fully-dynamic algorithm for MST
inferred← citeshttps://doi.org/10.1115/1.2802484openalex-snapshot
On the Problem of Scheduling Parallel Computations of Multibody Dynamic Analysis
inferred← citeshttps://doi.org/10.1142/s012962649900013xopenalex-snapshot
AN EREW PARM ALGORITHM FOR UPDATING MINIMUM SPANNING TREES
inferred← citeshttps://doi.org/10.1145/1989493.1989498openalex-snapshot
Parallelism in dynamic well-spaced point sets
inferred← citeshttps://doi.org/10.1145/3087556.3087595openalex-snapshot
Brief Announcement
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.1145/3490148.3538584openalex-snapshot
Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
inferred← citeshttps://doi.org/10.1145/3626183.3659976openalex-snapshot
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees
inferred← citeshttps://doi.org/10.1145/3627535.3638508openalex-snapshot
Parallel k-Core Decomposition with Batched Updates and Asynchronous Reads
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.