Dinic's algorithm

Known as: Blocking flow, Dinitz blocking flow algorithm 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
02419802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
We give an algorithm which computes a (1-ε)-approximately maximum st-flow in an undirected uncapacitated graph in time O(1… (More)
  • figure 1
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2007
2007
We consider solutions for distributed multicommodity flow problems, which are solved by multiple agents operating in a… (More)
  • figure 1
Is this relevant?
2006
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)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2004
2004
The maximum integer skew-symmetric flow problem (MSFP) generalizes both the maximum flow and maximum matching problems. It was… (More)
  • figure 1
  • figure 2
  • figure 3
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)
  • table 1
  • table 2
  • table 3
  • figure 1
  • figure 2
Is this relevant?
1998
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)
  • table 1
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1996
1996
Time evolutions of prominent blocking flow configurations over the North Pacific and Europe are compared based upon composites… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
1994
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
The J-Machine network is a 3-D mesh employing wormhole routing and virtual channels to provide two network priorities. Each… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?