Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Minimum_bottleneck_spanning_tree> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Minimum_bottleneck_spanning_tree abstract "In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck edge weight. For a directed graph, a similar problem is known as Minimum Bottleneck Spanning Arborescence (MBSA).".
- Minimum_bottleneck_spanning_tree wikiPageID "41228765".
- Minimum_bottleneck_spanning_tree wikiPageLength "8721".
- Minimum_bottleneck_spanning_tree wikiPageOutDegree "16".
- Minimum_bottleneck_spanning_tree wikiPageRevisionID "672214404".
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Algorithm.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Big-O_notation.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Big_O_notation.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Category:Graph_algorithms.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Category:Spanning_tree.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Dijkstras_algorithm.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Fibonacci_heap.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Glossary_of_graph_theory.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Minimum_spanning_tree.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Spanning_tree.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Weighted_graph.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:Camerini_Algorithm_1.svg.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:Camerini_Algorithm_2.svg.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:Camerini_Algorithm_3.svg.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:Camerini_Algorithm_4.svg.
- Minimum_bottleneck_spanning_tree wikiPageWikiLinkText "minimum bottleneck spanning tree".
- Minimum_bottleneck_spanning_tree hasPhotoCollection Minimum_bottleneck_spanning_tree.
- Minimum_bottleneck_spanning_tree wikiPageUsesTemplate Template:Reflist.
- Minimum_bottleneck_spanning_tree subject Category:Graph_algorithms.
- Minimum_bottleneck_spanning_tree subject Category:Spanning_tree.
- Minimum_bottleneck_spanning_tree hypernym Tree.
- Minimum_bottleneck_spanning_tree type Plant.
- Minimum_bottleneck_spanning_tree comment "In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck edge weight. For a directed graph, a similar problem is known as Minimum Bottleneck Spanning Arborescence (MBSA).".
- Minimum_bottleneck_spanning_tree label "Minimum bottleneck spanning tree".
- Minimum_bottleneck_spanning_tree sameAs m.012h__ww.
- Minimum_bottleneck_spanning_tree wasDerivedFrom Minimum_bottleneck_spanning_tree?oldid=672214404.
- Minimum_bottleneck_spanning_tree isPrimaryTopicOf Minimum_bottleneck_spanning_tree.
