Minimum survivable graphs with bounded distance increase.
Djelloul, Selma; Kouider, Mekkia
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2003)
- Volume: 6, Issue: 1, page 123-132
- ISSN: 1365-8050
Access Full Article
top
How to cite
topDjelloul, Selma, and Kouider, Mekkia. "Minimum survivable graphs with bounded distance increase.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 6.1 (2003): 123-132. <http://eudml.org/doc/124350>.
@article{Djelloul2003,
author = {Djelloul, Selma, Kouider, Mekkia},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {distance; fault-tolerance; spanning subgraph},
language = {eng},
number = {1},
pages = {123-132},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Minimum survivable graphs with bounded distance increase.},
url = {http://eudml.org/doc/124350},
volume = {6},
year = {2003},
}
TY - JOUR
AU - Djelloul, Selma
AU - Kouider, Mekkia
TI - Minimum survivable graphs with bounded distance increase.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2003
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 6
IS - 1
SP - 123
EP - 132
LA - eng
KW - distance; fault-tolerance; spanning subgraph
UR - http://eudml.org/doc/124350
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.