Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Push–relabel_maximum_flow_algorithm> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Push–relabel_maximum_flow_algorithm abstract "In mathematical optimization, the push–relabel algorithm (alternatively, preflow–push algorithm) is an algorithm for computing maximum flows. The name "push–relabel" comes from the two basic operations used in the algorithm. Throughout its execution, the algorithm maintains a "preflow" and gradually converts it into a maximum flow by moving flow locally between neighboring vertices using push operations under the guidance of an admissible network maintained by relabel operations. In comparison, the Ford–Fulkerson algorithm performs global augmentations that send flow following paths from the source all the way to the sink.The push–relabel algorithm is considered one of the most efficient maximum flow algorithms. The generic algorithm has a strongly polynomial O(V2E) time complexity, which is asymptotically more efficient than the O(VE2) Edmonds–Karp algorithm. Specific variants of the algorithms achieve even lower time complexities. The variant based on the highest label vertex selection rule has O(V2√E) time complexity and is generally regarded as the benchmark for maximum flow algorithms. Subcubic O(VE log (V2/E)) time complexity can be achieved using dynamic trees, although in practice it is less efficient.The push–relabel algorithm has been extended to compute minimum cost flows. The idea of distance labels has led to a more efficient augmenting path algorithm, which in turn can be incorporated back into the push–relabel algorithm to create a variant with even higher empirical performance.".
- Push–relabel_maximum_flow_algorithm wikiPageID "3444072".
- Push–relabel_maximum_flow_algorithm wikiPageRevisionID "604690172".
- Push–relabel_maximum_flow_algorithm subject Category:Graph_algorithms.
- Push–relabel_maximum_flow_algorithm subject Category:Network_flow.
- Push–relabel_maximum_flow_algorithm comment "In mathematical optimization, the push–relabel algorithm (alternatively, preflow–push algorithm) is an algorithm for computing maximum flows. The name "push–relabel" comes from the two basic operations used in the algorithm. Throughout its execution, the algorithm maintains a "preflow" and gradually converts it into a maximum flow by moving flow locally between neighboring vertices using push operations under the guidance of an admissible network maintained by relabel operations.".
- Push–relabel_maximum_flow_algorithm label "Algorithme de poussage/réétiquetage".
- Push–relabel_maximum_flow_algorithm label "Goldberg-Tarjan-Algorithmus".
- Push–relabel_maximum_flow_algorithm label "Push–relabel maximum flow algorithm".
- Push–relabel_maximum_flow_algorithm label "Алгоритм проталкивания предпотока".
- Push–relabel_maximum_flow_algorithm sameAs Push%E2%80%93relabel_maximum_flow_algorithm.
- Push–relabel_maximum_flow_algorithm sameAs Goldbergův_algoritmus.
- Push–relabel_maximum_flow_algorithm sameAs Goldberg-Tarjan-Algorithmus.
- Push–relabel_maximum_flow_algorithm sameAs réétiquetage.
- Push–relabel_maximum_flow_algorithm sameAs Algorytm_push-relabel.
- Push–relabel_maximum_flow_algorithm sameAs Q583889.
- Push–relabel_maximum_flow_algorithm sameAs Q583889.
- Push–relabel_maximum_flow_algorithm wasDerivedFrom Push–relabel_maximum_flow_algorithm?oldid=604690172.