Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Suurballes_algorithm> ?p ?o }
Showing triples 1 to 36 of
36
with 100 triples per page.
- Suurballes_algorithm abstract "In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length. The algorithm was conceived by John W. Suurballe and published in 1974. The main idea of Suurballe's algorithm is to use Dijkstra's algorithm to find one path, to modify the weights of the graph edges, and then to run Dijkstra's algorithm a second time. The modification to the weights is similar to the weight modification in Johnson's algorithm, and preserves the non-negativity of the weights while allowing the second instance of Dijkstra's algorithm to find the correct second path.The objective is strongly related to that of minimum cost flow algorithms, where in this case there are two units of \"flow\" and nodes have unit \"capacity\".".
- Suurballes_algorithm wikiPageID "29992976".
- Suurballes_algorithm wikiPageLength "7676".
- Suurballes_algorithm wikiPageOutDegree "14".
- Suurballes_algorithm wikiPageRevisionID "672534015".
- Suurballes_algorithm wikiPageWikiLink Category:Graph_algorithms.
- Suurballes_algorithm wikiPageWikiLink Category:Routing_algorithms.
- Suurballes_algorithm wikiPageWikiLink Dijkstras_algorithm.
- Suurballes_algorithm wikiPageWikiLink Directed_graph.
- Suurballes_algorithm wikiPageWikiLink Edge_disjoint_shortest_pair_algorithm.
- Suurballes_algorithm wikiPageWikiLink Fibonacci_heap.
- Suurballes_algorithm wikiPageWikiLink Johnsons_algorithm.
- Suurballes_algorithm wikiPageWikiLink Minimum-cost_flow_problem.
- Suurballes_algorithm wikiPageWikiLink Routing.
- Suurballes_algorithm wikiPageWikiLink Shortest_path_problem.
- Suurballes_algorithm wikiPageWikiLink Theoretical_computer_science.
- Suurballes_algorithm wikiPageWikiLink Vertex_(graph_theory).
- Suurballes_algorithm wikiPageWikiLink File:First_graph.jpg.
- Suurballes_algorithm wikiPageWikiLinkText "Suurballe's algorithm".
- Suurballes_algorithm wikiPageUsesTemplate Template:Math.
- Suurballes_algorithm wikiPageUsesTemplate Template:Mvar.
- Suurballes_algorithm wikiPageUsesTemplate Template:Reflist.
- Suurballes_algorithm subject Category:Graph_algorithms.
- Suurballes_algorithm subject Category:Routing_algorithms.
- Suurballes_algorithm hypernym Algorithm.
- Suurballes_algorithm type Software.
- Suurballes_algorithm type Algorithm.
- Suurballes_algorithm type Protocol.
- Suurballes_algorithm comment "In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted directed graph, so that both paths connect the same pair of vertices and have minimum total length. The algorithm was conceived by John W. Suurballe and published in 1974.".
- Suurballes_algorithm label "Suurballe's algorithm".
- Suurballes_algorithm sameAs Q7650417.
- Suurballes_algorithm sameAs m.0fqstnm.
- Suurballes_algorithm sameAs Surbalov_algoritam.
- Suurballes_algorithm sameAs Q7650417.
- Suurballes_algorithm wasDerivedFrom Suurballes_algorithm?oldid=672534015.
- Suurballes_algorithm isPrimaryTopicOf Suurballes_algorithm.