On the public citation graph

On Constructing Minimum Spanning Trees in R k 1

https://doi.org/10.1007/pl00009170
0 signed · 16 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/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1109/sfcs.1975.8openalex-snapshot
Closest-point problems
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1145/322123.322124openalex-snapshot
An O ( n log n ) Algorithm for Rectilinear Minimal Spanning Trees
inferredcites →https://doi.org/10.1145/322217.322219openalex-snapshot
Two-Dimensional Voronoi Diagrams in the L p -Metric
inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot
Scaling and related techniques for geometry problems

What points at this work

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

inferred← citeshttps://doi.org/10.1006/dspr.1997.0300openalex-snapshot
Voronoi Projection-Based Fast Nearest-Neighbor Search Algorithms: Box-Search and Mapping Table-Based Search Techniques
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_236openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_236-2openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1080/00949650108812080openalex-snapshot
Resistant estimation of multivariate location using minimum spanning trees
inferred← citeshttps://doi.org/10.1080/17445760.2012.664819openalex-snapshot
Energy-efficient communication in wireless cable sensor networks
inferred← citeshttps://doi.org/10.1109/tmc.2006.140openalex-snapshot
Virtual Backbone Construction in MANETs Using Adjustable Transmission Ranges
inferred← citeshttps://doi.org/10.1111/j.1467-9671.2011.01261.xopenalex-snapshot
Building Agent‐Based Walking Models by Machine‐Learning on Diverse Databases of Space‐Time Trajectory Samples
inferred← citeshttps://doi.org/10.1145/945394.945400openalex-snapshot
Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions
inferred← citeshttps://doi.org/10.5555/642160.642165openalex-snapshot
Minimum spanning trees in d dimensions
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.