Skip to content

Opening book details…

Can I read Redundant Networks and Minimum Distance on EtoBox?

Redundant Networks and Minimum Distance by Warren Dent is a Engineering article available to read on EtoBox.

What is Redundant Networks and Minimum Distance about?

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.

Who reads Redundant Networks and Minimum Distance?

It is typically read by researchers, students, and practitioners in Engineering.

Author
Warren Dent
Publisher
Elsevier Science; Elsevier ; Elsevier Ltd.; Elsevier BV (ISSN 0016-0032)
Published
1973
Language
EN
Field
Engineering (Physical Sciences)

More by Warren Dent

Browse all works by Warren Dent