𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Degree-Constrained Pyramid Spanners
✍ D. Richards; A.L. Liestman πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 401 KB

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\)-

On network flow functions
✍ Lloyd S. Shapley πŸ“‚ Article πŸ“… 1961 πŸ› John Wiley and Sons 🌐 English βš– 351 KB
cover
✍ Maas, Jonathan πŸ“‚ Fiction πŸ“… 2012 🌐 English βš– 169 KB πŸ‘ 2 views

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

cover
✍ Maas, Jonathan πŸ“‚ Fiction πŸ“… 2014;2012 🌐 English βš– 168 KB πŸ‘ 2 views

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

Minimum spanners of butterfly graphs
✍ Shien-Ching Hwang; Gen-Huey Chen πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 251 KB
Characterizing Multiterminal Flow Networ
✍ Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 417 KB

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