A \(t\)-spanner of a pyramid network is a subnetwork in which every two nodes that were connected by an edge in the original pyramid can be connected by a path in the subnetwork with at most \(t\) edges. We give several results that present trade-offs between \(t\) and the maximum degree of a \(t\)-
Network flow spanners
β Scribed by Feodor F. Dragan; Chenyu Yan
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 167 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Humans experience time linearly, living our lives from age one through whenever we die and aging as we go. Spanners, however, experience time differently. Some age backwards. Others do not age at all. Some age back and forth. And this non-linear experience with time and age gives Spanners a host of
Humans experience time linearly, living our lives from age one through whenever we die and aging as we go. Spanners, however, experience time differently. Some age backwards. Others do not age at all. Some age back and forth. And this non-linear experience with time and age gives Spanners a host of
We show that if a flow network has k inputΓoutput terminals (for the traditional maximum-flow problem, k=2), its external flow pattern (the possible values of flow into and out of the terminals) has two characterizations of size independent of the total number of vertices: a set of 2 k +1 inequaliti