Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Euclidean minimum spanning tree · Vinony

🌐English

English Français Русский فارسی ไทย 中文日本語

EntityQ4454941· pop 6· linked from 31 articles

Euclidean minimum spanning tree

the shortest network collecting a given set of points in the plane

Available in 6 languages

Русский
Serbian
Ukrainian
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

travelling salesperson problem

randomized algorithm

Categories

Geometric graphs Spanning tree

Sources

wikipedia.externallinksexternallink

Steiner tree problem

Entity

International Standard Book Number

digital object identifier

particle physics

equilateral triangle

South Moravian Region

Euclidean space

electrical grid

Sign in to save

What links here31 pages

relative neighborhood graph

geometric graph theory

Euclidean distance

iterated logarithm

travelling salesperson problem

widest path problem

nearest neighbor graph

Delaunay triangulation

minimum spanning tree

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

smallest-circle problem

Entitydist 0.38

shortest path problem

Entitydist 0.43

unit distance graph

Entitydist 0.47

Chan's algorithm

Entitydist 0.50

Entitydist 0.50

The Weber Problem

Entitydist 0.50

closest pair of points problem

Entitydist 0.51

Entitydist 0.55

Iterative closest point

Entitydist 0.55

nearest neighbour algorithm

Entitydist 0.56

Entitydist 0.56

convex polytope

Entitydist 0.58