| dbo:abstract |
In graph theory, the rectilinear minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in ℝd) 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. (en) Прямоугольное наименьшее остовное дерево (англ. Rectilinear Minimum Spanning Tree, RMST) набора из n точек на плоскости (в более общем случае — в пространстве ) — это минимальное остовное дерево этого набора, где веса рёбер между каждой парой точек равны расстоянию городских кварталов между этими двумя точками. (ru) |
| dbo:thumbnail |
wiki-commons:Special:FilePath/Rectilinear_minimum_spanning_tree.svg?width=300 |
| dbo:wikiPageID |
28153829 (xsd:integer) |
| dbo:wikiPageLength |
2659 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID |
922793779 (xsd:integer) |
| dbo:wikiPageWikiLink |
dbr:Prim's_algorithm dbc:Spanning_tree dbc:Geometric_graphs dbr:Integrated_circuit dbr:Electronic_circuits dbr:Complete_graph dbr:Rectilinear_Steiner_tree dbr:Physical_design_(electronics) dbr:Sweep_line_algorithm dbr:Adjacency_matrix dbc:Computational_geometry dbr:Euclidean_minimum_spanning_tree dbr:Graph_theory dbr:Divide_and_conquer_algorithm dbr:Plane_(mathematics) dbr:Minimum_spanning_tree dbr:Routing_(EDA) dbr:Rectilinear_distance dbr:File:Rectilinear_minimum_spanning_tree.svg |
| dbp:wikiPageUsesTemplate |
dbt:Reflist |
| dct:subject |
dbc:Spanning_tree dbc:Geometric_graphs dbc:Computational_geometry |
| gold:hypernym |
dbr:Tree |
| rdf:type |
yago:Abstraction100002137 yago:Communication100033020 yago:Graph107000195 yago:WikicatGeometricGraphs dbo:Plant yago:VisualCommunication106873252 |
| rdfs:comment |
In graph theory, the rectilinear minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in ℝd) 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. (en) Прямоугольное наименьшее остовное дерево (англ. Rectilinear Minimum Spanning Tree, RMST) набора из n точек на плоскости (в более общем случае — в пространстве ) — это минимальное остовное дерево этого набора, где веса рёбер между каждой парой точек равны расстоянию городских кварталов между этими двумя точками. (ru) |
| rdfs:label |
Rectilinear minimum spanning tree (en) Прямоугольное наименьшее остовное дерево (ru) |
| owl:sameAs |
freebase:Rectilinear minimum spanning tree yago-res:Rectilinear minimum spanning tree wikidata:Rectilinear minimum spanning tree dbpedia-ru:Rectilinear minimum spanning tree dbpedia-sr:Rectilinear minimum spanning tree https://global.dbpedia.org/id/4tgSQ |
| prov:wasDerivedFrom |
wikipedia-en:Rectilinear_minimum_spanning_tree?oldid=922793779&ns=0 |
| foaf:depiction |
wiki-commons:Special:FilePath/Rectilinear_minimum_spanning_tree.svg |
| foaf:isPrimaryTopicOf |
wikipedia-en:Rectilinear_minimum_spanning_tree |
| is dbo:wikiPageDisambiguates of |
dbr:Spanning_tree_(disambiguation) dbr:RMST |
| is dbo:wikiPageWikiLink of |
dbr:Rectilinear_Steiner_tree dbr:Spanning_tree_(disambiguation) dbr:Euclidean_minimum_spanning_tree dbr:RMST dbr:Minimum_spanning_tree |
| is foaf:primaryTopic of |
wikipedia-en:Rectilinear_minimum_spanning_tree |
