Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

<p>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&#39;s formula establishes a theoretically elegant recursive relationsh...

Popoln opis

Shranjeno v:
Bibliografske podrobnosti
Main Authors: Marlowe Thomas J., Schoppmann Laura
Format: Artigo
Jezik:Inglês
Izdano: Hindawi Limited 1998-01-01
Serija:Mathematical Problems in Engineering
Teme:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Online dostop:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Oznake: Označite
Brez oznak, prvi označite!

Podobne knjige/članki