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.

Edmonds–Karp algorithm · Vinony

EntityQ1302658· pop 17· linked from 119 articles

Edmonds–Karp algorithm

Sign in to save

algorithm

Connections

mathematical optimization

greedy algorithm

Bellman–Ford algorithm

convex optimization

computer science

International Standard Book Number

digital object identifier

linear programming

Dijkstra's algorithm

dynamic programming

breadth-first search

reductio ad absurdum

Richard M. Karp

simplex algorithm

Categories

Graph algorithms Network flow problem

Sources

wikipedia.externallinksexternallink

Similar entities

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

algorithm design

Entitydist 0.40

Nagle's algorithm

Entitydist 0.42

sequitur algorithm

Entitydist 0.43

Todd–Coxeter algorithm

Entitydist 0.45

Viterbi algorithm

Entitydist 0.48

Berlekamp's algorithm

Entitydist 0.51

interpolation search

Entitydist 0.52

Schoof's algorithm

Entitydist 0.52

Bluestein's FFT algorithm

Entitydist 0.53

diffusing update algorithm

Entitydist 0.54

Entitydist 0.55

Group method of data handling

Entitydist 0.55

What links here119 pages

ellipsoid method

approximation algorithm

golden section search

Broyden–Fletcher–Goldfarb–Shanno algorithm

nonlinear programming

Dijkstra's algorithm

convex optimization

Firefly algorithm

integer programming

ant colony optimization algorithms

Dinic's algorithm

register allocation

Newton's method in optimization

Coordinate descent

quadratic programming

Quasi-Newton method

Nelder–Mead method

Max-flow min-cut theorem

linear programming