Abstract
Up to now, we have only considered flows or circulations, respectively, for a given network. However, the converse question is very interesting, too: For given conditions on the flow, construct a network (with as little effort as possible) on which such a flow would be possible. On the one hand, we consider the case where all edges can be built with the same cost and we are looking for an undirected network with lower bounds on the maximal values of a flow between any two vertices. We analyze such ‘symmetric networks’ via ‘equivalent flow trees’ and ‘equivalent cut trees’. This technique has an interesting application for the construction of certain communication networks; this is discussed in Section 10.4. On the other hand, we look at the question of how to increase the maximal value of the flow for a given flow network by increasing the capacities of some edges as economically as possible.
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
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jungnickel, D. (1999). Synthesis of Networks. In: Graphs, Networks and Algorithms. Algorithms and Computation in Mathematics, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-03822-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-662-03822-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-03824-6
Online ISBN: 978-3-662-03822-2
eBook Packages: Springer Book Archive