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

Full description

Saved in:
Bibliographic Details
Main Authors: Marlowe Thomas J., Schoppmann Laura
Format: Artigo
Language:Inglês
Published: Hindawi Limited 1998-01-01
Series:Mathematical Problems in Engineering
Subjects:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Online Access:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items