Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Push%E2%80%93relabel_maximum_flow_algorithm> ?p ?o }
Showing triples 1 to 28 of
28
with 100 triples per page.
- Push%E2%80%93relabel_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%E2%80%93relabel_maximum_flow_algorithm wikiPageID "3444072".
- Push%E2%80%93relabel_maximum_flow_algorithm wikiPageRevisionID "639927994".
- Push%E2%80%93relabel_maximum_flow_algorithm align "center".
- Push%E2%80%93relabel_maximum_flow_algorithm alt "Final maximum flow network graph".
- Push%E2%80%93relabel_maximum_flow_algorithm alt "Initial flow network graph".
- Push%E2%80%93relabel_maximum_flow_algorithm border "1".
- Push%E2%80%93relabel_maximum_flow_algorithm caption "Final maximum flow network graph".
- Push%E2%80%93relabel_maximum_flow_algorithm caption "Initial flow network graph".
- Push%E2%80%93relabel_maximum_flow_algorithm hasPhotoCollection Push–relabel_maximum_flow_algorithm.
- Push%E2%80%93relabel_maximum_flow_algorithm image "Push Relabel Algoritm Example - Initial Graph.svg".
- Push%E2%80%93relabel_maximum_flow_algorithm image "Push-Relabel Algorithm Example - Final Network Graph.svg".
- Push%E2%80%93relabel_maximum_flow_algorithm title "C implementation".
- Push%E2%80%93relabel_maximum_flow_algorithm title "Python implementation".
- Push%E2%80%93relabel_maximum_flow_algorithm titlestyle "text-align:center".
- Push%E2%80%93relabel_maximum_flow_algorithm width "350".
- Push%E2%80%93relabel_maximum_flow_algorithm subject Category:Graph_algorithms.
- Push%E2%80%93relabel_maximum_flow_algorithm subject Category:Network_flow.
- Push%E2%80%93relabel_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%E2%80%93relabel_maximum_flow_algorithm label "Algorithme de poussage/réétiquetage".
- Push%E2%80%93relabel_maximum_flow_algorithm label "Algorytm push-relabel".
- Push%E2%80%93relabel_maximum_flow_algorithm label "Goldberg-Tarjan-Algorithmus".
- Push%E2%80%93relabel_maximum_flow_algorithm label "Goldbergův algoritmus".
- Push%E2%80%93relabel_maximum_flow_algorithm label "Push–relabel maximum flow algorithm".
- Push%E2%80%93relabel_maximum_flow_algorithm label "Алгоритм проталкивания предпотока".
- Push%E2%80%93relabel_maximum_flow_algorithm sameAs m.09cr90.
- Push%E2%80%93relabel_maximum_flow_algorithm wasDerivedFrom Push–relabel_maximum_flow_algorithm?oldid=639927994.
- Push%E2%80%93relabel_maximum_flow_algorithm isPrimaryTopicOf Push–relabel_maximum_flow_algorithm.
