Minimum survivable graphs with bounded distance increase
We study in graphs properties related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increases by more than k. In the design of interconnection networks such graphs guara...
保存先:
| 主要な著者: | , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
| シリーズ: | Discrete Mathematics & Theoretical Computer Science |
| 主題: | |
| オンライン･アクセス: | https://dmtcs.episciences.org/338/pdf |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|