Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Johnson's_algorithm> ?p ?o. }
Showing items 1 to 36 of
36
with 100 items per page.
- Johnson's_algorithm abstract "Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse, edge weighted, directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B. Johnson, who first published the technique in 1977.A similar reweighting technique is also used in Suurballe's algorithm for finding two disjoint paths of minimum total length between the same two vertices in a graph with non-negative edge weights.".
- Johnson's_algorithm thumbnail Johnson's_algorithm.svg?width=300.
- Johnson's_algorithm wikiPageExternalLink johnson_all_pairs_shortest.html.
- Johnson's_algorithm wikiPageID "1284311".
- Johnson's_algorithm wikiPageRevisionID "564595231".
- Johnson's_algorithm class Shortest_path_problem.
- Johnson's_algorithm data Graph_(abstract_data_type).
- Johnson's_algorithm hasPhotoCollection Johnson's_algorithm.
- Johnson's_algorithm subject Category:Graph_algorithms.
- Johnson's_algorithm type Abstraction100002137.
- Johnson's_algorithm type Act100030358.
- Johnson's_algorithm type Activity100407535.
- Johnson's_algorithm type Algorithm105847438.
- Johnson's_algorithm type Event100029378.
- Johnson's_algorithm type GraphAlgorithms.
- Johnson's_algorithm type Procedure101023820.
- Johnson's_algorithm type PsychologicalFeature100023100.
- Johnson's_algorithm type Rule105846932.
- Johnson's_algorithm type YagoPermanentlyLocatedEntity.
- Johnson's_algorithm comment "Johnson's algorithm is a way to find the shortest paths between all pairs of vertices in a sparse, edge weighted, directed graph. It allows some of the edge weights to be negative numbers, but no negative-weight cycles may exist. It works by using the Bellman–Ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing Dijkstra's algorithm to be used on the transformed graph. It is named after Donald B.".
- Johnson's_algorithm label "Algoritmo de Johnson".
- Johnson's_algorithm label "Algoritmo de Johnson".
- Johnson's_algorithm label "Algorytm Johnsona".
- Johnson's_algorithm label "Johnson's algorithm".
- Johnson's_algorithm label "Алгоритм Джонсона".
- Johnson's_algorithm sameAs Johnsonův_algoritmus.
- Johnson's_algorithm sameAs Algoritmo_de_Johnson.
- Johnson's_algorithm sameAs Algorytm_Johnsona.
- Johnson's_algorithm sameAs Algoritmo_de_Johnson.
- Johnson's_algorithm sameAs m.04q0b2.
- Johnson's_algorithm sameAs Q2345824.
- Johnson's_algorithm sameAs Q2345824.
- Johnson's_algorithm sameAs Johnson's_algorithm.
- Johnson's_algorithm wasDerivedFrom Johnson's_algorithm?oldid=564595231.
- Johnson's_algorithm depiction Johnson's_algorithm.svg.
- Johnson's_algorithm isPrimaryTopicOf Johnson's_algorithm.
