✦ LIBER ✦

Redundant networks and minimum distance

✍ Scribed by Warren Dent

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 587 KB
Volume: 295
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(73)90168-3

No coin nor oath required. For personal study only.

✦ Synopsis

Networks in which each node is directly linked to its nearest neighbors exhibit high reliability and message handling capability. The construction of such networks guaranteeing minimal length, for a given degree of redundancy, is formulated in zero-one integer linear programming terms. Initial feasible solutions to the programs are presented, but connectedness is not guaranteed. In the latter case further zero-one integer programs are proposed assuring connectedness, with given initial feasible solutions. The ineficiency of zero-one programs for large networks leads to consideration of alternate redundant connected networks, without guaranteed minimal length. These networks are based on "nearestneighbor edge sets", and are simple to construct. Various theorems on the properties of such networks are presented with applications to one-way communicability.

📜 SIMILAR VOLUMES

Construction of redundant networks with

Construction of redundant networks with minimum distance

✍ M.R. Steffen; Warren Dent 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 583 KB

A method for constructing redundant network8 and simultaneously minimizing total distance is presented. The method is well suited for digital computation. Its application to message switching systems is briefly discussed. ## 1. Zntroduction A communication network in which each station is connect

Minimum distance automata in parallel ne

Minimum distance automata in parallel networks for optimum classification

✍ Jack H. Winters; Christopher Rose 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Abstraet--ln this paper we study the parallel implementation of optimum classifiers. Specifically, we present a parallel implementation of the optimum (or maximum likelihood Gaussian) classifier that uses a cellular automaton to very rapidly find the output vector with minimum Euclidean distance fro

Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

We prove that in a graph of order n and minimum degree d, the mean distance µ must satisfy This asymptotically confirms, and improves, a conjecture of the computer program GRAFFITI. The result is close to optimal; examples show that for any d, µ may be larger than n/(d + 1).

Erratum: Mean distance and minimum degre

Erratum: Mean distance and minimum degree

✍ Kouider, Mekkia; Winkler, Peter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

95-99 mistakenly attributes the computer program GRAFFITI to Fajtlowitz and Waller, instead of just Fajtlowitz. (Our apologies to Siemion Fajtlowitz.) Note also that one of the ''flaws'' we note for Conjecture 62 (that it was made for graphs regular of degree d, vice graphs of minimum degree d) was

On minimum Hellinger distance estimation

✍ Jingjing Wu; Rohana J. Karunamuni 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 French ⚖ 400 KB

Average distance, minimum degree, and sp

Average distance, minimum degree, and spanning trees

✍ Dankelmann, Peter; Entringer, Roger 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

The average distance µ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., µ(G) = ( n 2 ) -1 {x,y}⊂V (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph