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… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Yin Tat Lee, Satish Rao, Nikhil Srivastava
- STOC
- 2013

We give an algorithm which computes a (1-ε)-approximately maximum st-flow in an undirected uncapacitated graph in time O(1… (More)

Is this relevant?

2007

2007

1 Efficient algorithms for max flow 1.1 Blocking flow and Dinic’s algorithm In this lecture, we’ll discuss about some other… (More)

Is this relevant?

2007

2007

- Baruch Awerbuch, Rohit Khandekar, Satish Rao
- SODA
- 2007

We consider solutions for distributed multicommodity flow problems, which are solved by multiple agents operating in a… (More)

Is this relevant?

2006

2006

- Yefim Dinitz
- Essays in Memory of Shimon Even
- 2006

This paper is devoted to the max-flow algorithm of the author: to its original version, which turned out to be unknown to… (More)

Is this relevant?

2004

2004

- Andrew V. Goldberg, Alexander V. Karzanov
- Math. Program.
- 2004

The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was… (More)

Is this relevant?

2003

2003

- 2003

The maximum flow algorithm is distinguished by the long line of successive contributions researchers have made in obtaining… (More)

Is this relevant?

1998

1998

- David R. Karger, Matthew S. Levine
- STOC
- 1998

Consider an n-vertex, m-edge, undirected graph with maximum flow value v. We give a method to find augmenting paths in such a… (More)

Is this relevant?

1996

1996

Time evolutions of prominent blocking flow configurations over the North Pacific and Europe are compared based upon composites… (More)

Is this relevant?

1994

1994

- Rajeev Motwani
- J. ACM
- 1994

We analyze the behavior of augmenting paths in random graphs. Our results show that in almost every graph, any nonmaximum O–1… (More)

Is this relevant?

1992

1992

- Peter R. Nuth, William J. Dally
- ICCD
- 1992

The J-Machine network is a 3-D mesh employing wormhole routing and virtual channels to provide two network priorities. Each… (More)

Is this relevant?