Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

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

Euclidean minimum spanning tree · Vinony

EntityQ4454941· pop 6· linked from 31 articles

Euclidean minimum spanning tree

Sign in to save

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

Connections

travelling salesperson problem

randomized algorithm

Steiner tree problem

International Standard Book Number

digital object identifier

particle physics

equilateral triangle

South Moravian Region

Euclidean space

electrical grid

Categories

Geometric graphs Spanning tree

Sources

wikipedia.externallinksexternallink

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