On the public citation graph
Minimum Spanning Trees in k -Dimensional Space
0 signed · 51 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/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
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.1093/comjnl/9.2.166openalex-snapshot
Programming, Games and Transportation Networks
inferredcites →https://doi.org/10.1109/t-c.1971.223083openalex-snapshot
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
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/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230260411openalex-snapshot
An O(N2) heuristic for steiner minimal trees in E3
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_38openalex-snapshot
On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-63397-9_26openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_15openalex-snapshot
A Robust Region Approach to the Computation of Geometric Graphs (Extended Abstract)
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-4419-7997-1_53openalex-snapshot
Steiner Minimum Trees in E3: Theory, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_17openalex-snapshot
Steiner Minimal Trees in E 3: Theory, Algorithms, and Applications
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-319-96133-0_11openalex-snapshot
An Efficient Approximate EMST Algorithm for Color Image Segmentation
inferred← citeshttps://doi.org/10.1007/978-3-319-96133-0_21openalex-snapshot
A Fast Two-Level Approximate Euclidean Minimum Spanning Tree Algorithm for High-Dimensional Data
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_236-2openalex-snapshot
Minimum Geometric Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-981-15-9519-6_8openalex-snapshot
An Effective Boundary Point Detection Algorithm Via k-Nearest Neighbors-Based Centroid
inferred← citeshttps://doi.org/10.1007/bf02067239openalex-snapshot
Minimal length tree networks on the unit sphere
inferred← citeshttps://doi.org/10.1007/bfb0028254openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1007/s00454-009-9137-7openalex-snapshot
Region-Fault Tolerant Geometric Spanners
inferred← citeshttps://doi.org/10.1007/s10878-019-00490-2openalex-snapshot
Degree bounded bottleneck spanning trees in three dimensions
inferred← citeshttps://doi.org/10.1016/0097-3165(95)90055-1openalex-snapshot
On the Steiner ratio in 3-space
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90252-bopenalex-snapshot
Fast geometric approximation techniques and geometric embedding problems
inferred← citeshttps://doi.org/10.1016/0925-7721(92)90001-9openalex-snapshot
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50006-1openalex-snapshot
Voronoi Diagrams**Partially supported by the Deutsche Forschungsgemeinschaft, grant K1 655 2-2.
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.asoc.2020.106676openalex-snapshot
Efficient construction of an approximate similarity graph for minimum spanning tree based clustering
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.012openalex-snapshot
A fast minimum spanning tree algorithm based on K-means
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.008openalex-snapshot
Well-separated pair decomposition in linear time?
inferred← citeshttps://doi.org/10.1016/j.neucom.2024.129054openalex-snapshot
A fast sparse graph based clustering technique using dispersion of data points
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot
Chapter 7 A survey of computational geometry
inferred← citeshttps://doi.org/10.1137/110825698openalex-snapshot
Triangulating the Square and Squaring the Triangle: Quadtrees and Delaunay Triangulations are Equivalent
inferred← citeshttps://doi.org/10.1142/s021819591850005xopenalex-snapshot
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
inferred← citeshttps://doi.org/10.1145/109648.109677openalex-snapshot
Construction of multidimensional spanner graphs, with applications to minimum spanning trees
inferred← citeshttps://doi.org/10.1145/116873.116880openalex-snapshot
Voronoi diagrams—a survey of a fundamental geometric data structure
inferred← citeshttps://doi.org/10.1145/142675.142717openalex-snapshot
New sparseness results on graph spanners
inferred← citeshttps://doi.org/10.1145/2582112.2582161openalex-snapshot
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels
inferred← citeshttps://doi.org/10.1145/2591796.2591805openalex-snapshot
Parallel algorithms for geometric graph problems
inferred← citeshttps://doi.org/10.1145/262839.262998openalex-snapshot
Proximity problems on moving points
inferred← citeshttps://doi.org/10.48550/arxiv.1401.0042openalex-snapshot
Parallel Algorithms for Geometric Graph Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1712.05591openalex-snapshot
Dynamic smooth compressed quadtrees (Fullversion)
inferred← citeshttps://doi.org/10.5555/1283383.1283384openalex-snapshot
Region-fault tolerant geometric spanners
inferred← citeshttps://doi.org/10.5555/313559.313777openalex-snapshot
Faster algorithms for some geometric graph problems in higher dimensions
inferred← citeshttps://doi.org/10.5555/642160.642165openalex-snapshot
Minimum spanning trees in d dimensions
inferred← citeshttps://doi.org/10.5555/644108.644242openalex-snapshot
Sublinear-time approximation of Euclidean minimum spanning tree
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.