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

Spanning tree approach in all-terminal network reliability expansion

โœ Scribed by N. Fard; Tae-Han Lee

Book ID
104273735
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
95 KB
Volume
24
Category
Article
ISSN
0140-3664

No coin nor oath required. For personal study only.

โœฆ Synopsis

A method is presented to maximize the reliability improvement of a communication network through a new edge addition between an existing node pair of the network. The method does not require the numerical reliability functions for determining such a node pair. The node pairs are compared by the number of spanning trees generated as a result of the connection of an additional link, and then the node pair connection, which results in generating the largest number of spanning trees, is determined. The counting process for the number of spanning trees of the expanded network is based on the degree matrix (DM) of the network.

๐Ÿ“œ SIMILAR VOLUMES

A petri net approach to determine all sp
A petri net approach to determine all spanning trees for overall reliability analysis of general networks
โœ Vinod Kumar; K.K. Aggarwal ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 361 KB

Petri Nets ( PNs) form a very useful model for procedures, organization and devices where information flows play an important role. They can represent the system at different levels of abstraction ranging from a single bit in a computer memory to the embedding of a computer system into its environme