DBpedia – Linked Data Fragments

Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Minimum_spanning_tree> ?p ?o }

• Minimum_spanning_tree abstract "A minimum spanning tree is a spanning tree of a connected, undirected graph. It connects all the vertices together with the minimal total weighting for its edges.A single graph can have many different spanning trees. We can also assign a weight to each edge, which is a number representing how unfavorable it is, and use this to assign a weight to a spanning tree by computing the sum of the weights of the edges in that spanning tree. A minimum spanning tree (MST) or minimum weight spanning tree is then a spanning tree with weight less than or equal to the weight of every other spanning tree. More generally, any undirected graph (not necessarily connected) has a minimum spanning forest, which is a union of minimum spanning trees for its connected components.There are quite a few use cases for minimum spanning trees. One example would be a telecommunications company which is trying to lay out cables in new neighborhood. If it is constrained to bury the cable only along certain paths (e.g. along roads), then there would be a graph representing which points are connected by those paths. Some of those paths might be more expensive, because they are longer, or require the cable to be buried deeper; these paths would be represented by edges with larger weights. Currency is an acceptable unit for edge weight — there is no requirement for edge lengths to obey normal rules of geometry such as the triangle inequality. A spanning tree for that graph would be a subset of those paths that has no cycles but still connects to every house; there might be several spanning trees possible. A minimum spanning tree would be one with the lowest total cost, thus would represent the least expensive path for laying the cable.".
• Minimum_spanning_tree thumbnail Minimum_spanning_tree.svg?width=300.
• Minimum_spanning_tree wikiPageExternalLink nesetril00otakar.html.
• Minimum_spanning_tree wikiPageExternalLink table_of_contents.html.
• Minimum_spanning_tree wikiPageExternalLink quickgraph.
• Minimum_spanning_tree wikiPageExternalLink eisner.mst-tutorial.pdf.
• Minimum_spanning_tree wikiPageExternalLink minimum-spanning-tree.shtml.
• Minimum_spanning_tree wikiPageID "41795".
• Minimum_spanning_tree wikiPageLength "39190".
• Minimum_spanning_tree wikiPageOutDegree "103".
• Minimum_spanning_tree wikiPageRevisionID "703070647".
• Minimum_spanning_tree wikiPageWikiLink Ackermann_function.
• Minimum_spanning_tree wikiPageWikiLink Alan_M._Frieze.
• Minimum_spanning_tree wikiPageWikiLink Arborescence_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Bernard_Chazelle.
• Minimum_spanning_tree wikiPageWikiLink Big_O_notation.
• Minimum_spanning_tree wikiPageWikiLink Borxc5xafvkas_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Broadcasting_(networking).
• Minimum_spanning_tree wikiPageWikiLink Brute-force_search.
• Minimum_spanning_tree wikiPageWikiLink Capacitated_minimum_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Category:Polynomial-time_problems.
• Minimum_spanning_tree wikiPageWikiLink Category:Spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Central_limit_theorem.
• Minimum_spanning_tree wikiPageWikiLink Charles_E._Leiserson.
• Minimum_spanning_tree wikiPageWikiLink Christofides_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Circuit_design.
• Minimum_spanning_tree wikiPageWikiLink Clifford_Stein.
• Minimum_spanning_tree wikiPageWikiLink Cluster_analysis.
• Minimum_spanning_tree wikiPageWikiLink Complete_graph.
• Minimum_spanning_tree wikiPageWikiLink Computer_network.
• Minimum_spanning_tree wikiPageWikiLink Computer_vision.
• Minimum_spanning_tree wikiPageWikiLink Conditional_random_field.
• Minimum_spanning_tree wikiPageWikiLink Connected_component_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Connectivity_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Cut_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Decision_problem.
• Minimum_spanning_tree wikiPageWikiLink Decision_tree.
• Minimum_spanning_tree wikiPageWikiLink Degree-constrained_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Directed_graph.
• Minimum_spanning_tree wikiPageWikiLink Distributed_computing.
• Minimum_spanning_tree wikiPageWikiLink Distributed_minimum_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Ecotoxicology.
• Minimum_spanning_tree wikiPageWikiLink Edge_contraction.
• Minimum_spanning_tree wikiPageWikiLink Edmonds_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Electrical_grid.
• Minimum_spanning_tree wikiPageWikiLink Euclidean_minimum_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Expected_linear_time_MST_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Extended_real_number_line.
• Minimum_spanning_tree wikiPageWikiLink External_sorting.
• Minimum_spanning_tree wikiPageWikiLink FP_(complexity).
• Minimum_spanning_tree wikiPageWikiLink Feature_extraction.
• Minimum_spanning_tree wikiPageWikiLink Finite_impulse_response.
• Minimum_spanning_tree wikiPageWikiLink Gene_expression.
• Minimum_spanning_tree wikiPageWikiLink Glossary_of_graph_theory.
• Minimum_spanning_tree wikiPageWikiLink Graph_(discrete_mathematics).
• Minimum_spanning_tree wikiPageWikiLink Greedy_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Handwriting_recognition.
• Minimum_spanning_tree wikiPageWikiLink Hierarchical_clustering.
• Minimum_spanning_tree wikiPageWikiLink Image_registration.
• Minimum_spanning_tree wikiPageWikiLink Image_segmentation.
• Minimum_spanning_tree wikiPageWikiLink Introduction_to_Algorithms.
• Minimum_spanning_tree wikiPageWikiLink J._Michael_Steele.
• Minimum_spanning_tree wikiPageWikiLink Jaroslav_Nešetřil.
• Minimum_spanning_tree wikiPageWikiLink K-minimum_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Kruskals_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Matching_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Maximum_flow_problem.
• Minimum_spanning_tree wikiPageWikiLink Minimum_bottleneck_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Minimum_spanning_tree-based_segmentation.
• Minimum_spanning_tree wikiPageWikiLink Moravia.
• Minimum_spanning_tree wikiPageWikiLink NP-completeness.
• Minimum_spanning_tree wikiPageWikiLink NP-hardness.
• Minimum_spanning_tree wikiPageWikiLink Natural_language_processing.
• Minimum_spanning_tree wikiPageWikiLink Observability.
• Minimum_spanning_tree wikiPageWikiLink Otakar_Borůvka.
• Minimum_spanning_tree wikiPageWikiLink P_(complexity).
• Minimum_spanning_tree wikiPageWikiLink Parallel_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Parsing.
• Minimum_spanning_tree wikiPageWikiLink Path_(graph_theory).
• Minimum_spanning_tree wikiPageWikiLink Prims_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Process_control.
• Minimum_spanning_tree wikiPageWikiLink Proof_by_contradiction.
• Minimum_spanning_tree wikiPageWikiLink Rectilinear_minimum_spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Reductio_ad_absurdum.
• Minimum_spanning_tree wikiPageWikiLink Regionalisation.
• Minimum_spanning_tree wikiPageWikiLink Reverse-delete_algorithm.
• Minimum_spanning_tree wikiPageWikiLink Riemann_zeta_function.
• Minimum_spanning_tree wikiPageWikiLink Ron_Rivest.
• Minimum_spanning_tree wikiPageWikiLink Single-linkage_clustering.
• Minimum_spanning_tree wikiPageWikiLink Soft_heap.
• Minimum_spanning_tree wikiPageWikiLink Spanning_Tree_Protocol.
• Minimum_spanning_tree wikiPageWikiLink Spanning_tree.
• Minimum_spanning_tree wikiPageWikiLink Steiner_tree_problem.
• Minimum_spanning_tree wikiPageWikiLink Svante_Janson.
• Minimum_spanning_tree wikiPageWikiLink Taxicab_geometry.
• Minimum_spanning_tree wikiPageWikiLink Taxonomy_(general).
• Minimum_spanning_tree wikiPageWikiLink Telecommunications_network.
• Minimum_spanning_tree wikiPageWikiLink Thomas_H._Cormen.
• Minimum_spanning_tree wikiPageWikiLink Transport_network.
• Minimum_spanning_tree wikiPageWikiLink Travelling_salesman_problem.

• next