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
8 - Electrical Flow Algorithms
Published online by Cambridge University Press: 21 August 2019
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
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Network Flow Algorithms , pp. 253 - 290Publisher: Cambridge University PressPrint publication year: 2019