About this document

Max Flow and Matching in Networks by 丁铭涛 is a document available to read on EtoBox.

The document outlines a series of network flow problems and their solutions using the Ford-Fulkerson algorithm. It describes various scenarios involving flow networks, including matching colonists to habitable zones, tourist currency exchanges, and scheduling Lyft drivers at an airport. Each section details the nodes, edges, capacities, and proofs of correctness for the flow networks constructed for different applications.

Author

丁铭涛

Language

EN