✦ LIBER ✦

On the Rabin number problem

✍ Scribed by Duh, Dyi-Rong; Chen, Gen-Huey

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 247 KB
Volume: 30
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199710)30:3<219::aid-net6>3.0.co;2-o

No coin nor oath required. For personal study only.

✦ Synopsis

Given positive integers k and l, let R(k, l) denote the class of interconnection networks so that for any k / 1 distinct nodes x, y 1 , y 2 , . . . , y k there exist k node-disjoint paths (except at x) of length at most l from x to y 1 , y 2 , . . . , y k , respectively. The Rabin number of a network W with connectivity k, denoted by r k (W ), is defined as min{lÉW √ R( k, l)}. The Rabin number problem is to compute r k (W ) for a given network W. Computing Rabin numbers for nontrivial networks is not easy, in general. Thus far, only the Rabin number of the hypercube has been computed. In this paper, some new results on the Rabin number problem are derived. First, a theorem relating the Rabin number with both wide diameter and fault diameter is obtained. This theorem can help in the derivation of lower bounds for the Rabin numbers of circulant networks, folded hypercubes, hierarchical folded-hypercube networks, generalized hypercubes, and WK-recursive networks. Moreover, upper bounds are also obtained for WK-recursive networks and a special class of generalized hypercubes. The Rabin numbers of a special class of circulant networks and a special class of generalized hypercubes are determined as a consequence of the derived upper and lower bounds.

📜 SIMILAR VOLUMES

On the lottery problem

✍ Zoltán Füredi; Gábor J. Székely; Zoltán Zubor 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB 👁 1 views

Let L(n, k, k, t ) denote the minimum number of k-subsets of an n-set such that all the ( i ) k-sets are intersected by one of them in at least t elements. In this article L(n,k,k,Z) is calculated for infinite sets of n's. We obtain L(90,5,5,2) = 100, i.e., 100 tickets needed to guarantee 2 corr

On the number of shredders

✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

A subset S of k vertices in a k-connected graph G is a shredder, if G -S has at least three components. We show that if G has n vertices, then the number of shredders is at most n, which was conjectured by Cheriyan and Thurimella [

On the face touching number

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 399 KB 👁 1 views

In a 3-connected plane graph, each pair of faces meet at at most either a vertex or an edge. Zha considered 3-connected graphs embedded on the projective plane, torus, and Klein bottle, showing that they meet at at most two, at most four, and a t most four vertices or edges, respectively, and demons

One Is the Loneliest Number

✍ Tom Clancy 📂 Fiction 🌐 English ⚖ 127 KB 👁 2 views

One Is the Loneliest Number

✍ Clancy, Tom;Pieczenik, Steve R. 📂 Fiction 📅 1999 🏛 Berkley Jam Books; Headline Feature 🌐 English ⚖ 127 KB 👁 2 views

In this new adventure, a fellow student makes life miserable for the rest of the Net Force by sabotaging a virtual simulation program. But when a Force exiles him from the group, the brilliant outcast creates a virtual playroom that will blow them all away. Based on the major mini-series from ABC-TV

One Is the Loneliest Number

✍ Duane, Diane 📂 Fiction 📅 1999 🏛 Berkley Publishing Group 🌐 English ⚖ 105 KB 👁 2 views

In the year 2010, computers are the new superpowers. Those who control them, control the world. To enforce the Net Laws, Congress creates the ultimate computer security agency within the FBI: Net Force. When the director of Net Force is assassinated, Deputy Director Alex Michaels is thrust into