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...
Bewaard in:
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artigo |
| Taal: | Inglês |
| Gepubliceerd in: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
| Reeks: | Discrete Mathematics & Theoretical Computer Science |
| Onderwerpen: | |
| Online toegang: | https://dmtcs.episciences.org/338/pdf |
| Tags: |
Geen labels, Wees de eerste die dit record labelt!
|