Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries: Shortest Path Algorithms
- 2 Maximum Flow Algorithms
- 3 Global Minimum Cut Algorithms
- 4 More Maximum Flow Algorithms
- 5 Minimum-Cost Circulation Algorithms
- 6 Generalized Flow Algorithms
- 7 Multicommodity Flow Algorithms
- 8 Electrical Flow Algorithms
- 9 Open Questions
- References
- Author Index
- Index
Contents
Published online by Cambridge University Press: 21 August 2019
- Frontmatter
- Contents
- Preface
- Acknowledgements
- 1 Preliminaries: Shortest Path Algorithms
- 2 Maximum Flow Algorithms
- 3 Global Minimum Cut Algorithms
- 4 More Maximum Flow Algorithms
- 5 Minimum-Cost Circulation Algorithms
- 6 Generalized Flow Algorithms
- 7 Multicommodity Flow Algorithms
- 8 Electrical Flow Algorithms
- 9 Open Questions
- References
- Author Index
- Index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781316888568/resource/name/firstPage-9781107185890toc_v-viii.jpg)
- Type
- Chapter
- Information
- Network Flow Algorithms , pp. v - viiiPublisher: Cambridge University PressPrint publication year: 2019