✦ LIBER ✦

Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter: II

✍ Scribed by Terunao Soneoka; Makoto Imase; Yoshifumi Manabe

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 750 KB
Volume: 64
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00113-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Design of a d-connected digraph with a m

Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter

✍ Terunao Soneoka; Hiroshi Nakada; Makoto Imase 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 640 KB

An algorithm for construction of a k-con

An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter

✍ Ulrich Schumacher 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

VLSI design of a FIR filter using CSD re

VLSI design of a FIR filter using CSD representation with minimum number of registers

✍ Ken'ichi Suzuki; Hiroshi Ochi; Shigenori Kinjo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB 👁 2 views

A method for constructing a fixed coefficient FIR filter with only adders without multipliers is proposed in this paper. Using past techniques, FIR filters can be constructed with only adders and adders used can be reduced by shared operations. However, since registers of an order greater than the o

Migration and mutation in stochastic mod

Migration and mutation in stochastic models of gene frequency change. II. Stochastic migration with a finite number of islands

✍ B. D. H. Latter; J. A. Sved 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 510 KB

Further results on the maximum size of a

Further results on the maximum size of a hole in an incomplete t-wise balanced design with specified minimum block size

✍ I. Adamczak; D. L. Kreher; A. C. H. Ling; R. S. Rees 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 1 views

## Abstract Kreher and Rees 3 proved that if __h__ is the size of a hole in an incomplete balanced design of order υ and index λ having minimum block size $k \ge t+1$, then, They showed that when __t__ = 2 or 3, this bound is sharp infinitely often in that for each __h__ ≥ __t__ and each __k__ ≥ _