English Hopcroft–Karp algorithm Cited by user Citation bot on 30 Apr 2024 {{Infobox algorithm|image = |data = Graph|time = can be achieved to find maximum-cardinality matchings in arbitrary graphs, with the more complicated algorithm of Micali…
English Yefim Dinitz Cited by user Vectornaut on 27 Dec 2023 Yefim Dinitz (Ефим Абрамович Диниц, יפים דיניץ) is a Soviet and Israeli computer scientist associated with the Moscow school of polynomial-time algorithms.
French Problème à promesse Cited by user Pyschobbens on 04 Mar 2023 Dans la théorie de la complexité computationnelle, un problème à promesse est une généralisation d'un problème de décision où l'entrée doit appartenir à un sous-ensemble…
English Dinic's algorithm Cited by user Ryankert on 23 Feb 2023 Dinic's algorithm or Dinitz's algorithm is a strongly polynomial algorithm for computing the maximum flow in a flow network, conceived in 1970 by Israeli (formerly Soviet…