In the Vinony graph
Within Vinony's link graph, Dinic算法 is referenced by 114 other articles, and connects out to mathematical optimization, greedy algorithm and Bellman–Ford algorithm.
Vinony files it under Graph algorithms and Network flow problem.
Its subject is documented across 14 Wikipedia language editions.
Article · 中文
迪尼茨算法是在网络流计算最大流的强多项式复杂度的算法，设想由以色列计算机科学家叶菲姆·迪尼茨在1970年提出。算法的时间复杂度类似于埃德蒙兹-卡普算法，其时间复杂度为，迪尼茨算法与埃德蒙兹-卡普算法的不同之处在于它每轮算法都选择最短的可行路径进行增广。迪尼茨算法中采用高度标号（level graph）以及阻塞流（blocking flow）实现性能。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
mathematical optimization
Entity
greedy algorithm
Entity
Bellman–Ford algorithm
Entity
maximum flow problem
Entity
convex optimization
Entity
International Standard Book Number
Entity
function
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
gradient
Entity
linear programming
Entity
Dijkstra's algorithm
Entity
dynamic programming
Entity
depth-first search
Entity
breadth-first search
Entity
Technion – Israel Institute of Technology
Entity
simplex algorithm
Entity
Prim's algorithm
Entity
evolutionary algorithm
Entity
minimum spanning tree
Entity