Description
Network flow theory and related material. Topics will include shortest paths, minimum spanning trees, maximum flows, minimum cost flows. Optimal matching in bipartite graphs.
Reference text in its original language
Network flow theory and related material. Topics will include shortest paths, minimum spanning trees, maximum flows, minimum cost flows. Optimal matching in bipartite graphs.
Sources and references
Dates and sources are retained to help you verify the information. Translations are provided to facilitate reading; the official source governs conditions and requirements.
Source reference : https://calendar.carleton.ca/grad/courses/MATH/