Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Minimum_bottleneck_spanning_tree> ?p ?o }
Showing triples 1 to 54 of
54
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 thumbnail MBST.png?width=300.
- Minimum_bottleneck_spanning_tree wikiPageID "41228765".
- Minimum_bottleneck_spanning_tree wikiPageLength "13905".
- Minimum_bottleneck_spanning_tree wikiPageOutDegree "36".
- Minimum_bottleneck_spanning_tree wikiPageRevisionID "702211803".
- Minimum_bottleneck_spanning_tree wikiPageWikiLink Algorithm.
- 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 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 wikiPageWikiLink File:MBSA-GT-example-1.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-2.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-3.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-4.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-5.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-6.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA-GT-example-7.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_1.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_10.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_11.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_2.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_3.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_4.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_5.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_6.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_7.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_8.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBSA_Example_9.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:MBST.png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLink File:Minimum_Bottleneck_Spanning_Arborescence_(MBSA).png.
- Minimum_bottleneck_spanning_tree wikiPageWikiLinkText "minimum bottleneck spanning tree".
- Minimum_bottleneck_spanning_tree wikiPageUsesTemplate Template:Math.
- Minimum_bottleneck_spanning_tree wikiPageUsesTemplate Template:Mvar.
- Minimum_bottleneck_spanning_tree wikiPageUsesTemplate Template:Reflist.
- Minimum_bottleneck_spanning_tree wikiPageUsesTemplate Template:Tmath.
- 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=702211803.
- Minimum_bottleneck_spanning_tree depiction MBST.png.
- Minimum_bottleneck_spanning_tree isPrimaryTopicOf Minimum_bottleneck_spanning_tree.
.png){kind=link}
