Abstract
Let us consider a network of pipelines of oil, gas, water, and so on. If we consider the case of network of pipes having values allowing flows only in one direction. It is important to note that each pipe has capacity. This type of network is represented by weighted connected graph in which stations are represented by vertices or nodes and lines through which given item such as oil, gas, water, electricity, etc., flows through by edges and capacities by weights.
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer India
About this chapter
Cite this chapter
Saha Ray, S. (2013). Network Flows. In: Graph Theory with Algorithms and its Applications. Springer, India. https://doi.org/10.1007/978-81-322-0750-4_10
Download citation
DOI: https://doi.org/10.1007/978-81-322-0750-4_10
Published:
Publisher Name: Springer, India
Print ISBN: 978-81-322-0749-8
Online ISBN: 978-81-322-0750-4
eBook Packages: EngineeringEngineering (R0)