Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Suurballe's_algorithm> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Suurballe's_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 J. 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".".
- Suurballe's_algorithm wikiPageID "29992976".
- Suurballe's_algorithm wikiPageRevisionID "586481111".
- Suurballe's_algorithm hasPhotoCollection Suurballe's_algorithm.
- Suurballe's_algorithm subject Category:Graph_algorithms.
- Suurballe's_algorithm subject Category:Routing_algorithms.
- Suurballe's_algorithm type Abstraction100002137.
- Suurballe's_algorithm type Act100030358.
- Suurballe's_algorithm type Activity100407535.
- Suurballe's_algorithm type Algorithm105847438.
- Suurballe's_algorithm type Event100029378.
- Suurballe's_algorithm type GraphAlgorithms.
- Suurballe's_algorithm type Procedure101023820.
- Suurballe's_algorithm type PsychologicalFeature100023100.
- Suurballe's_algorithm type RoutingAlgorithms.
- Suurballe's_algorithm type Rule105846932.
- Suurballe's_algorithm type YagoPermanentlyLocatedEntity.
- Suurballe's_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 J. W. Suurballe and published in 1974.".
- Suurballe's_algorithm label "Suurballe's algorithm".
- Suurballe's_algorithm sameAs m.0fqstnm.
- Suurballe's_algorithm sameAs Q7650417.
- Suurballe's_algorithm sameAs Q7650417.
- Suurballe's_algorithm sameAs Suurballe's_algorithm.
- Suurballe's_algorithm wasDerivedFrom Suurballe's_algorithm?oldid=586481111.
- Suurballe's_algorithm isPrimaryTopicOf Suurballe's_algorithm.