Skip to search formSkip to main contentSkip to account menu

Dinic's algorithm

Known as: Blocking flow, Dinic, 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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Breadth-first searchEdmonds–Karp algorithmFlow networkFord–Fulkerson algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Multi-criteria blocking flow shop scheduling problems: Formulation and performance analysis
Most of the prior investigations related to production scheduling problems have solely focused on the optimization of an… 
Review
2015
Review
2015
LUSI MITIGATION IMPLICATIONS OF BPLS AND OTHER SUBSIDENCE MEASUREMENTS
Since the beginning of LUSI eruption, extrusion of mud has been accompanied by deformation of the land surface extending out as… 
2011
2011
Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony
This paper considers a discrete artificial bee colony (DABC) algorithm for the blocking flow shop (BFS) scheduling problem to… 
2010
2010
New insights on the blocking flow shop problem
We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well… 
2009
2009
Equine Nutritional Secondary Hyperparathyroidism CAUSES
feeding a ration with an improper calcium:phosphofus ratio, which causes hypersecretion of pararhyroid hormone (PTH) and results… 
2002
2002
Allocating kanbans for a production system in a general configuration with a new control strategy
We consider a production system in a general configuration with a new control strategy: the push policy for the part sending and… 
1999
1999
A strongly polynomial algorithm for the Balanced network flow problem
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of finding a feasible flow on a… 
1998
1998
Performance issues in the design of hierarchical-ring and direct networks for shared-memory multiprocessors
This dissertation explores performance issues in the design of interconnection networks for shared-memory multiprocessors. In… 
1987
1987
An Efficient Way for Edge-Connectivity Augmentation.
Abstract : The problem in which the object is to add a minimum weight set of edges to a graph G = (V,E) so as to satisfy a given… 
1978
1978
The Max Flow of Dinic and Karzanov: An Exposition
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)