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...
| Publicado en: | Communications of the ACM Vol. 66; no. 12; pp. 84 - 85 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Dec2023
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=173715675&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 173715675 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Dec2023 vid: 66 iid: 12 pid: 68 pub: Association for Computing Machinery artinfo: ui: 173715675 10.1145/3623277 ppf: 84 ppct: 1 formats: tig: atl: Maximum Flow through a Network: A Storied Problem and a Groundbreaking Solution. aug: au: Shang-Hua Teng affil: The Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California su: Algorithms Computer networks Computer science Data flow computing Big data Information science Information storage & retrieval systems sug: subj: Algorithms Computer networks Computer science Data flow computing Big data Information science Information storage & retrieval systems ab: 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. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2023 holdings: @attributes: islocal: N |
|---|