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

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Marlowe Thomas J., Schoppmann Laura
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Hindawi Limited 1998-01-01
Sarja:Mathematical Problems in Engineering
Aiheet:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Linkit:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!

Samankaltaisia teoksia