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

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Marlowe Thomas J., Schoppmann Laura
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Hindawi Limited 1998-01-01
Saila:Mathematical Problems in Engineering
Gaiak:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Sarrera elektronikoa:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!

Antzeko izenburuak