Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution.

The article provides a perspective on the use of algorithms in maintaining maximum flow through computing networks. Offers a critique of various max-flow theorems and algorithms. Discusses prior research into max-flow applications. Mentions the hope for future breakthroughs in developing scalable ma...

Descripción completa

Detalles Bibliográficos
Publicado en:Communications of the ACM Vol. 66; no. 12; pp. 84 - 85
Autor principal: Shang-Hua Teng
Formato: Artículo
Publicado: Association for Computing Machinery Dec2023
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario:The article provides a perspective on the use of algorithms in maintaining maximum flow through computing networks. Offers a critique of various max-flow theorems and algorithms. Discusses prior research into max-flow applications. Mentions the hope for future breakthroughs in developing scalable max-flow algorithms.