๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Undirected loop networks

โœ Scribed by Sheng Chen; Xing-De Jia

Book ID
102545758
Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
237 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Gossiping and routing in undirected trip
Gossiping and routing in undirected triple-loop networks
โœ Alison Thomson; Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 194 KB

Given integers n โ‰ฅ 7 and a, b, c with 1 โ‰ค a, b, c โ‰ค n -1 such that a, na, b, nb, c, nc are pairwise distinct, the (undirected) triple-loop network TL n (a, b, c) is the degree-six graph with vertices 0, 1, 2, . . . , n -1 such that each vertex x is adjacent to x ยฑ a, x ยฑ b, and x ยฑ c, where the oper

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

Locating Sources to Meet Flow Demands in
Locating Sources to Meet Flow Demands in Undirected Networks
โœ Kouji Arata; Satoru Iwata; Kazuhisa Makino; Satoru Fujishige ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 260 KB

This paper deals with the problem of finding a minimum-cost vertex subset S in an undirected network such that for each vertex v we can send d v units of flow from S to v. Although this problem is NP-hard in general, H.