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

תיאור מלא

שמור ב:
מידע ביבליוגרפי
Main Authors: Marlowe Thomas J., Schoppmann Laura
פורמט: Artigo
שפה:Inglês
יצא לאור: Hindawi Limited 1998-01-01
סדרה:Mathematical Problems in Engineering
נושאים:
Computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert&#39;s formula; graphs; polynomial-time computations
גישה מקוונת:http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!

פריטים דומים