On the public citation graph

Offline algorithms for dynamic minimum spanning tree problems

https://doi.org/10.1007/bfb0028278
0 signed · 22 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-52846-6_76openalex-snapshot
Finding the k smallest 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.1007/bfb0015746openalex-snapshot
Efficient algorithms for graphic matroid intersection and parity
inferredcites →https://doi.org/10.1016/0022-0000(78)90022-3openalex-snapshot
Algorithms for updating minimal spanning trees
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/fscs.1990.89594openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
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.5555/320176.320177openalex-snapshot
Maintenance of a minimum spanning forest in a dynamic planar graph

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45253-2_32openalex-snapshot
Maintaining a Minimum Spanning Tree under Transient Node Failures
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_234openalex-snapshot
How to treat delete requests in semi-online problems
inferred← citeshttps://doi.org/10.1007/978-3-030-79987-8_39openalex-snapshot
Approximating Multistage Matching Problems
inferred← citeshttps://doi.org/10.1007/bf01994879openalex-snapshot
Finding thek smallest spanning trees
inferred← citeshttps://doi.org/10.1007/bf02574030openalex-snapshot
Dynamic Euclidean minimum spanning trees and extrema of binary functions
inferred← citeshttps://doi.org/10.1007/pl00009479openalex-snapshot
Raising Roofs, Crashing Cycles, and Playing Pool: Applications of a Data Structure for Finding Pairwise Interactions
inferred← citeshttps://doi.org/10.1007/s00453-022-00951-xopenalex-snapshot
Approximating Multistage Matching Problems
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00109openalex-snapshot
Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267816openalex-snapshot
Dynamic half-space reporting, geometric optimization, and minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.1137/1.9781611976465.74openalex-snapshot
Vertex Sparsification for Edge Connectivity
inferred← citeshttps://doi.org/10.1145/3313276.3316379openalex-snapshot
Fully dynamic spectral vertex sparsifiers and applications
inferred← citeshttps://doi.org/10.5555/314464.314490openalex-snapshot
Clustering for faster network simplex pivots
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.