Maximal Flow Through a Network
Year: 2009
Type: book-chapter
Source: Birkhäuser Boston eBooks
Parent work: Classic Papers in Combinatorics
Authors: L. R. Ford, D. R. Fulkerson
Institution: RAND Corporation
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2002531683