Dinitz' algorithm: the original version and even's version

Authors:
Yefim Dinitz
Affiliations:
Dept. of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Theoretical Computer Science
Year:
2006

Citing 10
Cited 5

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
An O(n2 log n) parallel max-flow algorithm

Journal of Algorithms
A data structure for dynamic trees

Journal of Computer and System Sciences
Introduction to algorithms

Introduction to algorithms
Finding minimum-cost circulations by successive approximation

Mathematics of Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Beyond the flow decomposition barrier

Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Journal of the ACM (JACM)
Graph Algorithms

Graph Algorithms
Recent Developments in Maximum Flow Algorithms (Invited Lecture)

SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory

Faster algorithms for semi-matching problems

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
A generalization of Nemhauser and Trotter's local optimization theorem

Journal of Computer and System Sciences
An overview of algorithms for network survivability

ISRN Communications and Networking
Mining structural hole spanners through information diffusion in social networks

Proceedings of the 22nd international conference on World Wide Web
Data transmission and base-station placement for optimizing the lifetime of wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper is devoted to the max-flow algorithm of the author: to its original version, which turned out to be unknown to non-Russian readers, and to its modification created by Shimon Even and Alon Itai; the latter became known worldwide as “Dinic's algorithm”. It also presents the origins of the Soviet school of algorithms, which remain unknown to the Western Computer Science community, and the substantial influence of Shimon Even on the fortune of this algorithm.