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.
2016
2016
Population-based multi-layer iterated greedy algorithm for solving blocking flow shop scheduling problem
2015
2015
Scheduling Blocking Flow Shops Using Meta-RaPS
Review
2015
Review
2015
A review of recent progress on Tibet's role in the South Asian monsoon
The Tibetan Plateau exerts a profound influence on winds in boreal winter primarily through mechanical means, blocking flow to… 
2015
2015
Minimizing Regular Objectives for Blocking Permutation Flow Shop Scheduling: Heuristic Approaches
The objective of this work is to present and evaluate meta-heuristics for the blocking permutation flow shop scheduling problem… 
2014
2014
Boundary Detection Method for Large-Scale Coverage Holes in Wireless Sensor Network Based on Minimum Critical Threshold Constraint
The existing coverage hole boundary detection methods cannot detect large-scale coverage hole boundary in wireless sensor network… 
2011
2011
Apply the discrete artificial bee colony algorithm to the blocking flow shop problem with makespan criterion
This paper applies the discrete artificial bee colony (DABC) algorithm to the blocking flow shop (BFS) scheduling problem with… 
Highly Cited
2005
Highly Cited
2005
Biomechanics and Mechanotransduction in Cells and Tissues Vascular endothelial wound closure under shear stress : role of membrane fluidity and flow-sensitive ion channels
Gojova, Andrea, and Abdul I. Barakat. Vascular endothelial wound closure under shear stress: role of membrane fluidity and flow… 
1999
1999
Throttle and preempt: A flow control policy for real-time traffic in wormhole networks
1997
1997
Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5
The problem of finding a minimum weight k-vertex connected spanning subgraph is considered. For k>1, this problem is known to be… 
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… 
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)