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

Volledige beschrijving

Bewaard in:
Bibliografische gegevens
Hoofdauteurs: Marlowe Thomas J., Schoppmann Laura
Formaat: Artigo
Taal:Inglês
Gepubliceerd in: Hindawi Limited 1998-01-01
Reeks:Mathematical Problems in Engineering
Onderwerpen:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Online toegang:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Tags: Voeg label toe
Geen labels, Wees de eerste die dit record labelt!

Gelijkaardige items