Minimum survivable graphs with bounded distance increase - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2003

Minimum survivable graphs with bounded distance increase

Abstract

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 guarantee good fault-tolerance properties. We give upper and lower bounds on the minimum number of edges of a k-self-repairing graph for prescribed k and n, where n is the order of the graph. We prove that the problem of finding, in a k-self-repairing graph, a spanning k-self-repairing subgraph of minimum size is NP-Hard.
Fichier principal
Vignette du fichier
dm060110.pdf (90.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958995 , version 1 (13-03-2014)

Identifiers

Cite

Selma Djelloul, Mekkia Kouider. Minimum survivable graphs with bounded distance increase. Discrete Mathematics and Theoretical Computer Science, 2003, Vol. 6 no. 1 (1), pp.123-132. ⟨10.46298/dmtcs.338⟩. ⟨hal-00958995⟩
120 View
814 Download

Altmetric

Share

Gmail Facebook X LinkedIn More