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.

Ford–Fulkerson algorithm · Vinony

EntityQ284695· pop 21· linked from 136 articles

Ford–Fulkerson algorithm

Sign in to save

algorithm

Connections

International Standard Book Number

digital object identifier

Euclidean algorithm

depth-first search

breadth-first search

greedy algorithm

O’Reilly Media

Max-flow min-cut theorem

maximum flow problem

Edmonds–Karp algorithm

Charles E. Leiserson

Categories

Graph algorithms Network flow problem

Sources

wikipedia.externallinksexternallink

Similar entities

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

Steinhaus–Johnson–Trotter algorithm

Entitydist 0.62

Category:Optimization algorithms

Entitydist 0.62

Category:Combinatorial optimization

Entitydist 0.63

Category:Ford platforms

Entitydist 0.63

Smith–Waterman algorithm

Entitydist 0.64

Category:Mathematical optimization

Entitydist 0.64

merge algorithm

Entitydist 0.64

Category:Ford Ranges

Entitydist 0.65

Category:Approximation algorithms

Entitydist 0.65

Category:Ford administration personnel

Entitydist 0.65

Category:Stochastic optimization

Entitydist 0.65

Category:Ford trucks

Entitydist 0.65

What links here136 pages

Floyd–Warshall algorithm

ellipsoid method

approximation algorithm

nonlinear programming

Dijkstra's algorithm

Broyden–Fletcher–Goldfarb–Shanno algorithm

golden section search

convex optimization

Firefly algorithm

integer programming

ant colony optimization algorithms

Dinic's algorithm

register allocation

Newton's method in optimization

Coordinate descent

quadratic programming

breadth-first search

Quasi-Newton method

Nelder–Mead method

Max-flow min-cut theorem