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...

Celý popis

Uloženo v:
Podrobná bibliografie
Hlavní autoři: Marlowe Thomas J., Schoppmann Laura
Médium: Artigo
Jazyk:Inglês
Vydáno: Hindawi Limited 1998-01-01
Edice:Mathematical Problems in Engineering
Témata:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
On-line přístup:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!

Podobné jednotky