DBpedia – Linked Data Fragments

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

• Widest_path_problem abstract "In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight of the minimum-weight edge in the path. The widest path problem is also known as the bottleneck shortest path problem or the maximum capacity path problem. It is possible to adapt most shortest path algorithms to compute widest paths, by modifying them to use the bottleneck distance instead of path length. However, in many cases even faster algorithms are possible.For instance, in a graph that represents connections between routers in the Internet, where the weight of an edge represents the bandwidth of a connection between two routers, the widest path problem is the problem of finding an end-to-end path between two Internet nodes that has the maximum possible bandwidth. The weight of the minimum-weight edge is known as the capacity or bandwidth of the path. As well as its applications in network routing, the widest path problem is also an important component of the Schulze method for deciding the winner of a multiway election, and has been applied to digital compositing, metabolic analysis, and the computation of maximum flows.A closely related problem, the minimax path problem, asks for the path that minimizes the maximum weight of any of its edges. It has applications that include transportation planning. Any algorithm for the widest path problem can be transformed into an algorithm for the minimax path problem, or vice versa, by reversing the sense of all the weight comparisons performed by the algorithm, or equivalently by replacing every edge weight by its negation.".
• Widest_path_problem thumbnail CPT-Graphs-undirected-weighted.svg?width=300.
• Widest_path_problem wikiPageExternalLink 6580214.
• Widest_path_problem wikiPageID "31567349".
• Widest_path_problem wikiPageLength "22061".
• Widest_path_problem wikiPageOutDegree "61".
• Widest_path_problem wikiPageRevisionID "707648403".
• Widest_path_problem wikiPageWikiLink Aerial_photography.
• Widest_path_problem wikiPageWikiLink Algorithm.
• Widest_path_problem wikiPageWikiLink Asymptotic_computational_complexity.
• Widest_path_problem wikiPageWikiLink Bandwidth_(computing).
• Widest_path_problem wikiPageWikiLink Breadth-first_search.
• Widest_path_problem wikiPageWikiLink Cartesian_tree.
• Widest_path_problem wikiPageWikiLink Category:Computational_problems_in_graph_theory.
• Widest_path_problem wikiPageWikiLink Category:Graph_algorithms.
• Widest_path_problem wikiPageWikiLink Category:Network_theory.
• Widest_path_problem wikiPageWikiLink Category:Polynomial-time_problems.
• Widest_path_problem wikiPageWikiLink Condorcet_method.
• Widest_path_problem wikiPageWikiLink Data_structure.
• Widest_path_problem wikiPageWikiLink Dense_graph.
• Widest_path_problem wikiPageWikiLink Depth-first_search.
• Widest_path_problem wikiPageWikiLink Digital_compositing.
• Widest_path_problem wikiPageWikiLink Dijkstras_algorithm.
• Widest_path_problem wikiPageWikiLink Directed_graph.
• Widest_path_problem wikiPageWikiLink Edmonds–Karp_algorithm.
• Widest_path_problem wikiPageWikiLink Election.
• Widest_path_problem wikiPageWikiLink Euclidean_minimum_spanning_tree.
• Widest_path_problem wikiPageWikiLink Floyd–Warshall_algorithm.
• Widest_path_problem wikiPageWikiLink Ford–Fulkerson_algorithm.
• Widest_path_problem wikiPageWikiLink Gaussian_integer.
• Widest_path_problem wikiPageWikiLink Gaussian_moat.
• Widest_path_problem wikiPageWikiLink Geometric_spanner.
• Widest_path_problem wikiPageWikiLink Glossary_of_graph_theory.
• Widest_path_problem wikiPageWikiLink Graph_(discrete_mathematics).
• Widest_path_problem wikiPageWikiLink Image_registration.
• Widest_path_problem wikiPageWikiLink Integer_sorting.
• Widest_path_problem wikiPageWikiLink Internet.
• Widest_path_problem wikiPageWikiLink Iterated_logarithm.
• Widest_path_problem wikiPageWikiLink Lattice_graph.
• Widest_path_problem wikiPageWikiLink List_of_algorithms.
• Widest_path_problem wikiPageWikiLink Lowest_common_ancestor.
• Widest_path_problem wikiPageWikiLink Matrix_multiplication.
• Widest_path_problem wikiPageWikiLink Maximum_flow_problem.
• Widest_path_problem wikiPageWikiLink Median.
• Widest_path_problem wikiPageWikiLink Metabolic_network.
• Widest_path_problem wikiPageWikiLink Minimum_spanning_tree.
• Widest_path_problem wikiPageWikiLink Monotonic_function.
• Widest_path_problem wikiPageWikiLink Number_theory.
• Widest_path_problem wikiPageWikiLink Path_(graph_theory).
• Widest_path_problem wikiPageWikiLink Priority_queue.
• Widest_path_problem wikiPageWikiLink Ranked_voting_system.
• Widest_path_problem wikiPageWikiLink Recursion.
• Widest_path_problem wikiPageWikiLink Router_(computing).
• Widest_path_problem wikiPageWikiLink Schulze_method.
• Widest_path_problem wikiPageWikiLink Shortest_path_problem.
• Widest_path_problem wikiPageWikiLink Sign_(mathematics).
• Widest_path_problem wikiPageWikiLink Sorting_algorithm.
• Widest_path_problem wikiPageWikiLink Time_complexity.
• Widest_path_problem wikiPageWikiLink Tournament_(graph_theory).
• Widest_path_problem wikiPageWikiLink Two-dimensional_space.
• Widest_path_problem wikiPageWikiLink Ultrametric_space.
• Widest_path_problem wikiPageWikiLink Vertex_(graph_theory).
• Widest_path_problem wikiPageWikiLink Wikimedia_Foundation.
• Widest_path_problem wikiPageWikiLink File:CPT-Graphs-undirected-weighted.svg.
• Widest_path_problem wikiPageWikiLinkText "Widest paths/Maximum bandwidth paths".
• Widest_path_problem wikiPageWikiLinkText "minimax path problem".
• Widest_path_problem wikiPageWikiLinkText "minimax path".
• Widest_path_problem wikiPageWikiLinkText "widest path problem".
• Widest_path_problem wikiPageWikiLinkText "widest path".
• Widest_path_problem wikiPageWikiLinkText "widest paths".
• Widest_path_problem wikiPageUsesTemplate Template:Harvtxt.
• Widest_path_problem wikiPageUsesTemplate Template:Log-star.
• Widest_path_problem wikiPageUsesTemplate Template:Math.
• Widest_path_problem wikiPageUsesTemplate Template:Mvar.
• Widest_path_problem wikiPageUsesTemplate Template:Reflist.
• Widest_path_problem wikiPageUsesTemplate Template:Sqrt.
• Widest_path_problem subject Category:Computational_problems_in_graph_theory.
• Widest_path_problem subject Category:Graph_algorithms.
• Widest_path_problem subject Category:Network_theory.
• Widest_path_problem subject Category:Polynomial-time_problems.
• Widest_path_problem hypernym Problem.
• Widest_path_problem type Disease.
• Widest_path_problem type Algorithm.
• Widest_path_problem comment "In graph algorithms, the widest path problem is the problem of finding a path between two designated vertices in a weighted graph, maximizing the weight of the minimum-weight edge in the path. The widest path problem is also known as the bottleneck shortest path problem or the maximum capacity path problem. It is possible to adapt most shortest path algorithms to compute widest paths, by modifying them to use the bottleneck distance instead of path length.".
• Widest_path_problem label "Widest path problem".
• Widest_path_problem sameAs Q7998708.
• Widest_path_problem sameAs m.0glrt2m.
• Widest_path_problem sameAs Problem_najšireg_puta.
• Widest_path_problem sameAs Bài_toán_đường_đi_rộng_nhất.
• Widest_path_problem sameAs Q7998708.
• Widest_path_problem wasDerivedFrom Widest_path_problem?oldid=707648403.
• Widest_path_problem depiction CPT-Graphs-undirected-weighted.svg.
• Widest_path_problem isPrimaryTopicOf Widest_path_problem.