Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Ford–Fulkerson_algorithm> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Ford–Fulkerson_algorithm abstract "The Ford–Fulkerson method is an algorithm which computes the maximum flow in a flow network. It was published in 1956 by L. R. Ford, Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a specialization of Ford–Fulkerson.The idea behind the algorithm is as follows: As long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of these paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.".
- Ford–Fulkerson_algorithm wikiPageID "53777".
- Ford–Fulkerson_algorithm wikiPageRevisionID "604900624".
- Ford–Fulkerson_algorithm subject Category:Articles_with_example_pseudocode.
- Ford–Fulkerson_algorithm subject Category:Graph_algorithms.
- Ford–Fulkerson_algorithm subject Category:Network_flow.
- Ford–Fulkerson_algorithm comment "The Ford–Fulkerson method is an algorithm which computes the maximum flow in a flow network. It was published in 1956 by L. R. Ford, Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a specialization of Ford–Fulkerson.The idea behind the algorithm is as follows: As long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of these paths.".
- Ford–Fulkerson_algorithm label "Algorithme de Ford-Fulkerson".
- Ford–Fulkerson_algorithm label "Algorithmus von Ford und Fulkerson".
- Ford–Fulkerson_algorithm label "Algoritmo de Ford-Fulkerson".
- Ford–Fulkerson_algorithm label "Algoritmo de Ford-Fulkerson".
- Ford–Fulkerson_algorithm label "Algoritmo di Ford-Fulkerson".
- Ford–Fulkerson_algorithm label "Ford–Fulkerson algorithm".
- Ford–Fulkerson_algorithm label "Metoda Forda-Fulkersona".
- Ford–Fulkerson_algorithm label "Алгоритм Форда — Фалкерсона".
- Ford–Fulkerson_algorithm label "フォード・ファルカーソンのアルゴリズム".
- Ford–Fulkerson_algorithm sameAs Ford%E2%80%93Fulkerson_algorithm.
- Ford–Fulkerson_algorithm sameAs Fordův-Fulkersonův_algoritmus.
- Ford–Fulkerson_algorithm sameAs Algorithmus_von_Ford_und_Fulkerson.
- Ford–Fulkerson_algorithm sameAs Algoritmo_de_Ford-Fulkerson.
- Ford–Fulkerson_algorithm sameAs Algorithme_de_Ford-Fulkerson.
- Ford–Fulkerson_algorithm sameAs Algoritmo_di_Ford-Fulkerson.
- Ford–Fulkerson_algorithm sameAs フォード・ファルカーソンのアルゴリズム.
- Ford–Fulkerson_algorithm sameAs Metoda_Forda-Fulkersona.
- Ford–Fulkerson_algorithm sameAs Algoritmo_de_Ford-Fulkerson.
- Ford–Fulkerson_algorithm sameAs Q284695.
- Ford–Fulkerson_algorithm sameAs Q284695.
- Ford–Fulkerson_algorithm wasDerivedFrom Ford–Fulkerson_algorithm?oldid=604900624.