Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
Reliability is an important consideration in analyzing computer and other communication networks, but current techniques are extremely limited in the classes of graphs which can be analyzed efficiently. While Gilbert's formula establishes a theoretically elegant recursive relationship between t...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1998-01-01
|
| Series: | Mathematical Problems in Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S1024123X98000817 |