Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02178909n
Noun Concept
Categories: Spanning tree, Geometric graphs, Computational geometry
EN
rectilinear minimum spanning tree
EN
In graph theory, the rectilinear minimum spanning tree of a set of n points in the plane is a minimum spanning tree of that set, where the weight of the edge between each pair of points is the rectilinear distance between those two points. Wikipedia
Definitions
Sources
EN
In graph theory, the rectilinear minimum spanning tree of a set of n points in the plane is a minimum spanning tree of that set, where the weight of the edge between each pair of points is the rectilinear distance between those two points. Wikipedia
An algorithm in graph theory Wikipedia Disambiguation
Algorithm in graph theory Wikidata
Wikipedia
EN
rectilinear minimum spanning tree
Wikidata
EN
Rectilinear minimum spanning tree

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License