✦ LIBER ✦

Optimum requirement spanning trees and reliability of tree networks

✍ Scribed by Anazawa, Tsutomu; Kodera, Takayuki; Jimbo, Masakazu

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 130 KB
Volume: 34
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199909)34:2<122::aid-net5>3.0.co;2-p

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, an explicit solution of the optimum requirement spanning tree (ORST), studied by Hu, is obtained in the case when a weight is assigned to each node and when maximum-degree conditions are given. Further, the solution is shown to minimize the probability of communication failure in the situation where one node or line is broken down.

📜 SIMILAR VOLUMES

On a condition for obtaining an explicit

On a condition for obtaining an explicit solution of optimum requirement spanning tree

✍ Anazawa, Tsutomu 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 70 KB

The optimum requirement spanning tree (ORST) studied by Hu is known to be obtained by the Gomory-Hu algorithm when the degrees of vertices are not restricted. We consider a problem to find an ORST with maximum-degree constraints and suggest a particular spanning tree T\* as a candidate for the solut

On spanning trees and walks of low maxim

On spanning trees and walks of low maximum degree

✍ Daniel P. Sanders; Yue Zhao 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB 👁 2 views

Calculating the number of spanning trees

Calculating the number of spanning trees in a labeled planar molecular graph whose inner dual is a tree

✍ P. E. John; R. B. Mallion 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 496 KB 👁 2 views

The quantum mechanical relevance of the concept of a spanning tree extant within a given molecular graph-specifically, one that may be considered to represent the carbon-atom connectivity of a particular (planar) conjugated system-was first explicitly pointed out by Professor Roy McWeeny in his now-

VESGEN 2D: Automated, User-Interactive S

VESGEN 2D: Automated, User-Interactive Software for Quantification and Mapping of Angiogenic and Lymphangiogenic Trees and Networks

✍ Mary B. Vickerman; Patricia A. Keith; Terri L. McKay; Dan J. Gedeon; Michiko Wat 📂 Article 📅 2009 🏛 Wiley (John Wiley & Sons) 🌐 English ⚖ 314 KB

## Abstract Pseudocolor view of vascular branching generations in the chorioallantoic membrane (CAM) of quail. Vascular architecture was analyzed using the automated, user‐interactive software, VESsel GENeration Analysis (VESGEN). See Vickerman, et al., on page 320, in this issue.

New efficient breadth-first/level traver

New efficient breadth-first/level traversal tree search method for the design and upgrade of sensor networks

✍ Duy Quang Nguyen; Miguel J. Bagajewicz 📂 Article 📅 2010 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 427 KB 👁 1 views

## Abstract This work studies the problem of optimally locating sensors for monitoring chemical processes, formally known as the sensor network design and upgrade problem. This problem is an integer programming problem and has been solved to global optimality only using tree search methods using de