Dinitz’ Algorithm: The Original Version and Even’s Version

2006/01/01 by Yefim Dinitz · 1 citation
Computer Science · #Algorithm #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Computer science #Optimization and Search Problems

paper · doi:10.1007/11685654_10

crossref issued 2006/01/01 · crossref published 2006/01/01 · crossref published-print 2006/01/01 · openalex publication_date 2006/01/01 · crossref created 2006/03/10 · crossref deposited 2021/04/27 · openalex created_date 2025/10/10 · crossref indexed 2026/07/02 · openalex updated_date 2026/07/29

Citations

• A data structure for dynamic trees
• A new approach to the maximum-flow problem
• Beyond the flow decomposition barrier
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• An n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs

Cited by

• Hopcroft–Karp algorithm [wikipedia]