Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

Dinic's algorithm · Vinony

EntityQ730933· pop 14· linked from 114 articles

Dinic's algorithm

Sign in to save

algorithm for computing the maximal flow of a network

Connections

mathematical optimization

greedy algorithm

Bellman–Ford algorithm

maximum flow problem

convex optimization

International Standard Book Number

digital object identifier

International Standard Serial Number

linear programming

Dijkstra's algorithm

dynamic programming

depth-first search

breadth-first search

Technion – Israel Institute of Technology

simplex algorithm

Prim's algorithm

evolutionary algorithm

minimum spanning tree

Categories

Graph algorithms Network flow problem

Sources

wikipedia.externallinksexternallink

What links here114 pages

Floyd–Warshall algorithm

ellipsoid method

approximation algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

Dijkstra's algorithm

nonlinear programming

golden section search

convex optimization

Firefly algorithm

integer programming

ant colony optimization algorithms

register allocation

Newton's method in optimization

Coordinate descent

quadratic programming

Quasi-Newton method

Nelder–Mead method

linear programming

Edmonds–Karp algorithm

mathematical optimization

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

winner-take-all

Entitydist 0.63

Entitydist 0.66

Karp's 21 NP-complete problems

Entitydist 0.67

rxponential hierarchy

Entitydist 0.68

Entitydist 0.69

Noisy-channel coding theorem

Entitydist 0.69

Horton 96-graph

Entitydist 0.69

Lattice Boltzmann methods

Entitydist 0.70

Bernstein-Vazirani algorithm

Entitydist 0.71

Saturation current

Entitydist 0.71

Deutsch–Jozsa algorithm

Entitydist 0.72

space complexity

Entitydist 0.73