✦ LIBER ✦

On network flow functions

✍ Scribed by Lloyd S. Shapley

Publisher: John Wiley and Sons
Year: 1961
Tongue: English
Weight: 351 KB
Volume: 8
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800080204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Higher-order differentiation of network

Higher-order differentiation of network functions using signal flow graphs

✍ Stanislaw Osowski 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

On a function for the vulnerability of a

On a function for the vulnerability of a directed flow network

✍ Masakazu Sengoku; Shoji Shinoda; Reigo Yatsuboshi 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 441 KB 👁 1 views

The concept of vulnerability of a network, by which we mean the susceptibility of the network to attack, is very useful for the design of networks such as computer networks and communication networks. In this paper, a directed flow network, in which a nonnegative real number called edge capacity or

Network flow spanners

✍ Feodor F. Dragan; Chenyu Yan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB

On multiroute maximum flows in networks

✍ Charu C. Aggarwal; James B. Orlin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

## Abstract Let __G__ = (__N, A__) be a network with a designated source node __s__, a designated sink node __t__, and a finite integral capacity __u~ij~__ on each arc (__i, j__) ∈ __A__. An elementary __K__‐flow is a flow of __K__ units from __s__ to __t__ such that the flow on each arcis 0 or 1.

Network flow model for binary tomography

Network flow model for binary tomography on lattices

✍ Pablo M. Salzberg; Pedro I. Rivera-Vega; Ariel Rodríguez 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 212 KB

In this contribution we present a network-flow approach The application of known algorithms poses a problem because to the reconstruction of binary functions on planar or spatial lattices. the tilt range of the crystal is normally restricted, for several We develop a family of reconstruction algo

Multiple cover problem on undirected flo

Multiple cover problem on undirected flow networks

✍ Hiroshi Tamura; Hidehito Sugawara; Masakazu Sengoku; Shoji Shinoda 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

Problems concerning the optimum location of various devices installed in transport, communication, and other types of networks relate to the so-called location on network problems. In this paper, we show how an expanded multiple cover problem can be solved in polynomial time for the case of an undir