Abstract
Network flow problems are usually presented in terms of directed graphs. A directed graph is the same as the graphs we’ve been working with, except that each edge is assigned a direction. Another way of stating the distinction is that, whereas in an undirected graph each edge is a pair of vertices, in a directed graph each edge is an Ordered pair of vertices.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Birkhäuser Boston
About this chapter
Cite this chapter
Pólya, G., Tarjan, R.E., Woods, D.R. (2010). Network Flow. In: Notes on Introductory Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4953-1_12
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4953-1_12
Published:
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4954-8
Online ISBN: 978-0-8176-4953-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)