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

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Marlowe Thomas J., Schoppmann Laura
Formato: Artigo
Idioma:Inglês
Publicado em: Hindawi Limited 1998-01-01
Colecção:Mathematical Problems in Engineering
Assuntos:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
Acesso em linha:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registos relacionados