On the public citation graph

Computing euclidean maximum spanning trees

0 signed · 45 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/978-1-4612-1098-6openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1007/bf01840359openalex-snapshot

Geometric applications of a matrix-searching algorithm

inferredcites →https://doi.org/10.1007/bf02187699openalex-snapshot

Diameter partitioning

inferredcites →https://doi.org/10.1007/bf02289588openalex-snapshot

Hierarchical Clustering Schemes

inferredcites →https://doi.org/10.1016/0196-6774(82)90018-9openalex-snapshot

The NP-completeness column: An ongoing guide

inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot

The NP-completeness column: An ongoing guide

inferredcites →https://doi.org/10.1016/b978-0-444-87806-9.50008-6openalex-snapshot

On Geometric Algorithms that use the Furthest-Point Voronoi Diagram

inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot

How to search in history

inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot

On the History of the Minimum Spanning Tree Problem

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.1137/0215021openalex-snapshot

The Ultimate Planar Convex Hull Algorithm?

inferredcites →https://doi.org/10.1142/9789812794499_others01openalex-snapshot

Computational Geometry

inferredcites →https://doi.org/10.1145/73393.73419openalex-snapshot

Clustering algorithms based on minimum and maximum spanning trees

inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot

Scaling and related techniques for geometry problems

inferredcites →https://doi.org/10.2307/1377831openalex-snapshot

Principles of Numerical Taxonomy

inferredcites →https://doi.org/10.4324/9780203766804-11openalex-snapshot

Principles of Numerical Taxonomy

What points at this work

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

inferred← citeshttps://doi.org/10.1007/0-387-23639-2_2openalex-snapshot

(Generalized) Convexity and Discrete Optimization

inferred← citeshttps://doi.org/10.1007/3-540-47789-6_2openalex-snapshot

Extreme Distances in Multicolored Point Sets

inferred← citeshttps://doi.org/10.1007/978-3-031-27051-2_7openalex-snapshot

Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees

inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_17openalex-snapshot

Maximum Plane Trees in Multipartite Geometric Graphs

inferred← citeshttps://doi.org/10.1007/978-3-319-78455-7_2openalex-snapshot

On the Longest Spanning Tree with Neighborhoods

inferred← citeshttps://doi.org/10.1007/978-3-540-89524-4_41openalex-snapshot

A Fault-Tolerant Event Boundary Detection Algorithm in Sensor Networks

inferred← citeshttps://doi.org/10.1007/bf02293049openalex-snapshot

Transitions in geometric minimum spanning trees

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/bfb0054308openalex-snapshot

Faster non-linear parametric search with applications to optimization and dynamic geometry

inferred← citeshttps://doi.org/10.1007/s00373-021-02325-6openalex-snapshot

Maximum Spanning Trees in Normed Planes

inferred← citeshttps://doi.org/10.1007/s00453-017-0375-4openalex-snapshot

Spanning Trees in Multipartite Geometric Graphs

inferred← citeshttps://doi.org/10.1007/s00453-018-0482-xopenalex-snapshot

Maximum Plane Trees in Multipartite Geometric Graphs

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/0925-7721(95)00018-6openalex-snapshot

Average case analysis of dynamic geometric optimization

inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50024-9openalex-snapshot

Convexity and Discrete Optimization

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.comgeo.2018.10.004openalex-snapshot

Geometric clustering in normed planes

inferred← citeshttps://doi.org/10.1016/j.jhydrol.2022.127478openalex-snapshot

The Advanced Meteorology Explorer: a novel stochastic, gridded daily rainfall generator

inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80124-0openalex-snapshot

Chapter 7 A survey of computational geometry

inferred← citeshttps://doi.org/10.1109/icde.2016.7498317openalex-snapshot

Efficiently computing reverse k furthest neighbors

inferred← citeshttps://doi.org/10.1142/9789812773289_0003openalex-snapshot

Extreme Distances in Multicolored Point Sets

inferred← citeshttps://doi.org/10.1142/s1793830920500676openalex-snapshot

On the longest spanning tree with neighborhoods

inferred← citeshttps://doi.org/10.1145/1062689.1062708openalex-snapshot

Characterizing achievable multicast rates in multi-hop wireless networks

inferred← citeshttps://doi.org/10.48550/arxiv.1611.01661openalex-snapshot

Spanning Trees in Multipartite Geometric Graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1712.03297openalex-snapshot

On the Longest Spanning Tree with Neighborhoods

inferred← citeshttps://doi.org/10.48550/arxiv.2010.03870openalex-snapshot

Improved approximation ratios for two Euclidean maximum spanning tree problems

inferred← citeshttps://doi.org/10.5555/314464.314481openalex-snapshot

Average case analysis of dynamic geometric optimization

inferred← citeshttps://doi.org/10.7155/jgaa.00080openalex-snapshot

Extreme Distances in Multicolored Point Sets

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.