On the public citation graph
Finding thek smallest spanning trees
0 signed · 36 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-50728-0_58openalex-snapshot
On the spanning trees of weighted graphs
inferredcites →https://doi.org/10.1007/bf02187749openalex-snapshot
A linear-time algorithm for computing the voronoi diagram of a convex polygon
inferredcites →https://doi.org/10.1007/bf02526034openalex-snapshot
Sorting helps for voronoi diagrams
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.1007/bfb0028278openalex-snapshot
Offline algorithms for dynamic minimum spanning tree problems
inferredcites →https://doi.org/10.1007/s10801-022-01148-9openalex-snapshot
Combinatorics, graph theory, and computing
inferredcites →https://doi.org/10.1016/0196-6774(91)90022-qopenalex-snapshot
Finding k points with minimum diameter and related problems
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/sfcs.1975.26openalex-snapshot
Preserving order in a forest in less than logarithmic time
inferredcites →https://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1137/0210017openalex-snapshot
An Algorithm for Finding K Minimum Spanning Trees
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/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
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.1006/jagm.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_156openalex-snapshot
Fully Dynamic Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-0-387-77780-1_3openalex-snapshot
The Label-Constrained Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_156openalex-snapshot
Fully Dynamic Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_17openalex-snapshot
Minimum Monotone Spanning Trees
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00127-0openalex-snapshot
The minimum labeling spanning trees
inferred← citeshttps://doi.org/10.1109/glsv.1994.289959openalex-snapshot
Generation of color-constrained spanning trees with application in symbolic circuit analysis
inferred← citeshttps://doi.org/10.1109/pccc.2000.830328openalex-snapshot
Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185429openalex-snapshot
Ambivalent data structures for dynamic 2-edge-connectivity and k smallest 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/s0097539792226825openalex-snapshot
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
inferred← citeshttps://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
inferred← citeshttps://doi.org/10.2478/v10108-010-0018-2openalex-snapshot
Identifying Different Meanings of a Chinese Morpheme through Semantic Pattern Matching in Augmented Minimum Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05102openalex-snapshot
Enumeration of Enumeration Algorithms
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.