Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,794,577 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
8 relations
Breadth-first search
Edmonds–Karp algorithm
Flow network
Ford–Fulkerson algorithm
Expand
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
Ghita Lebbar
,
I. E. Abbassi
,
Abdelouahhab Jabri
,
A. E. Barkany
,
M. Darcherif
Advances in Production Engineering & Management
2018
Corpus ID: 56110190
Most of the prior investigations related to production scheduling problems have solely focused on the optimization of an…
Expand
Review
2016
Review
2016
Pharmacological and Medicinal Potential from Flowers of Perfume Tree
P. Panneerselvam
,
V. B. Narayanan
,
R. Durai
2016
Corpus ID: 19988041
Michelia champaca L. belonging to the family Magnoliaceae is also called as Champak and has high medicinal applications. In…
Expand
2012
2012
An Analysis of Blocking vs Non-Blocking Flow Control in On-Chip Networks
2012
Corpus ID: 14367312
High end System-on-Chip (SoC) architectures consist of tens of processing engines. These processing engines have varied traffic…
Expand
2011
2011
Minimizing the Total Flowtime Flowshop with Blocking Using a Discrete Artificial Bee Colony
Yu-yan Han
,
Jun-Hua Duan
,
Yu-Jie Yang
,
Min Zhang
,
Bao Yun
International Conference on Intelligent Computing
2011
Corpus ID: 37960530
This paper considers a discrete artificial bee colony (DABC) algorithm for the blocking flow shop (BFS) scheduling problem to…
Expand
2011
2011
New best solutions for the blocking flow shop problem
Ramon Pascual
,
Immaculada Ribas Vila
2011
Corpus ID: 60389585
2010
2010
New insights on the blocking flow shop problem
Ramon Pascual
,
Immaculada Ribas Vila
2010
Corpus ID: 60435093
We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well…
Expand
2002
2002
Allocating kanbans for a production system in a general configuration with a new control strategy
Xiaobo Zhao
,
K. Nakashima
,
Z. Zhang
IEEE Trans. Syst. Man Cybern. Part A
2002
Corpus ID: 20091556
We consider a production system in a general configuration with a new control strategy: the push policy for the part sending and…
Expand
1998
1998
Performance issues in the design of hierarchical-ring and direct networks for shared-memory multiprocessors
M. Stumm
,
G. Ravindran
1998
Corpus ID: 61979912
This dissertation explores performance issues in the design of interconnection networks for shared-memory multiprocessors. In…
Expand
1987
1987
An Efficient Way for Edge-Connectivity Augmentation.
Toshimasa Watanabe
1987
Corpus ID: 28572448
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…
Expand
1978
1978
The Max Flow of Dinic and Karzanov: An Exposition
S. Even
Jerusalem Conference on Information Technology
1978
Corpus ID: 12080768