ロード中...
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's formula establishes a theoretically elegant recursive relationsh...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Hindawi Limited
1998-01-01
|
| シリーズ: | Mathematical Problems in Engineering |
| 主題: | |
| オンライン･アクセス: | http://www.hindawi.net/access/get.aspx?journal=mpe&volume=4&pii=S1024123X98000817 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|