Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Minimum_degree_spanning_tree> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Minimum_degree_spanning_tree abstract "In graph theory, for a connected graph , a spanning tree is a subgraph of with the least number of edges that still spans . A number of properties can be proved about . is acyclic, has edges where is the number of vertices in etc. A minimum degree spanning tree is a spanning tree which has the least maximum degree. The vertex of maximum degree in is the least among all possible spanning trees of .See Degree-Constrained Spanning Tree.".
- Minimum_degree_spanning_tree wikiPageID "2624629".
- Minimum_degree_spanning_tree wikiPageRevisionID "542842238".
- Minimum_degree_spanning_tree hasPhotoCollection Minimum_degree_spanning_tree.
- Minimum_degree_spanning_tree subject Category:Spanning_tree.
- Minimum_degree_spanning_tree comment "In graph theory, for a connected graph , a spanning tree is a subgraph of with the least number of edges that still spans . A number of properties can be proved about . is acyclic, has edges where is the number of vertices in etc. A minimum degree spanning tree is a spanning tree which has the least maximum degree. The vertex of maximum degree in is the least among all possible spanning trees of .See Degree-Constrained Spanning Tree.".
- Minimum_degree_spanning_tree label "Minimum degree spanning tree".
- Minimum_degree_spanning_tree sameAs m.07sk9j.
- Minimum_degree_spanning_tree sameAs Q6865444.
- Minimum_degree_spanning_tree sameAs Q6865444.
- Minimum_degree_spanning_tree wasDerivedFrom Minimum_degree_spanning_tree?oldid=542842238.
- Minimum_degree_spanning_tree isPrimaryTopicOf Minimum_degree_spanning_tree.