Efficient Maximum Flow Algorithms.

The article discusses basic techniques concerning maximum flow algorithms that have applications in science and engineering. Topics addressed include distinctions between polynomial and strongly polynomial flow algorithms, polynomial-time algorithms resulting from the idea of augmenting along the sh...

Descripción completa

Detalles Bibliográficos

Publicado en:	Communications of the ACM Vol. 57; no. 8; pp. 82 - 90
Autores principales:	GOLDBERG, ANDREW V., TARJAN, ROBERT E.
Formato:	Artículo
Publicado:	Association for Computing Machinery Aug2014
Materias:	Polynomial time algorithms Algorithms Data structures Computational complexity Computable functions Computer input design
Acceso en línea:	Ver este registro en EBSCOhost