Serafino Cicerone, Gabriele Di Stefano  Home/Search
Context Related
| dsiaq.ing.univaq.it/~cicero...JDA03a.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dsiaq.ing.univaq.it/~cic...papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A network modeled as a graph in BID(k) can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is at most k times the distance in the non-faulty graph. The smallest k such that G 2 BID(k) is called stretch number of G. We show an... (Update)
Similar documents based on text: More All
0.6: Graphs with Bounded Induced Distance - Cicerone, Di Stefano (1998) (Correct)
0.4: Survivable Networks with Bounded Delay - Cicerone, Di Stefano, Handke (1999) (Correct)
0.4: Low-Congested Interval Routing Schemes for.. - Cicerone, Di Stefano.. (2003) (Correct)
Related documents from co-citation: More All
3: Discrete Applied mathematics (context) - Hammer, Maffray et al. - 1990
2: Flammini Compact-Port routing models and applications to distance-hereditary gra.. (context) - Cicerone, Di Stefano - 2001
2: Graphs with bounded induced distance - Cicerone, Di Stefano - 1998
BibTeX entry: (Update)
S. Cicerone and G. Di Stefano, Networks with small stretch number, International Workshop, Graph - Theoretic Concepts in Computer Science (WG), vol. 1928. http://citeseer.ist.psu.edu/cicerone28networks.html More
@inproceedings{ cicerone00networks,
author = "Serafino Cicerone and Gabriele Di Stefano",
title = "Networks with Small Stretch Number",
booktitle = "Workshop on Graph-Theoretic Concepts in Computer Science",
pages = "95-106",
year = "2000",
url = "citeseer.ist.psu.edu/cicerone28networks.html" }
Citations (may not include all citations):474 Graph Theory (context) - Harary - 1969
37 Journal of Graph Theory (context) - Peleg, Schaffer - 1989
31 Interval routing (context) - van Leeuwen, Tan - 1987
28 the fault tolerance of some popular boundeddegree networks - Leighton, Maggs et al. - 1998
24 Discrete Applied Mathematics (context) - Hammer, Maffray et al. - 1990
21 Distance-hereditary graphs (context) - Bandelt, Mulder - 1986
21 A graph model for fault-tolerant computing systems (context) - Hayes - 1976
18 Decomposition of directed graphs (context) - Cunningham - 1982
13 SIAM Monographs on Discrete Mathematics and Applications (context) - Brandstadt, Le and et al. - 1999
10 Fault-tolerant meshes with small degree - Bruck, Cypher et al. - 1997
9 Dominating cliques in distance-hereditary graphs (context) - Dragan - 1994
7 Distance-hereditary graphs (context) - D'Atri, Moscarini - 1988
7 Graph classes between parity and distance-hereditary graphs - Cicerone, Di Stefano - 1999
6 Distance-hereditary graphs and multidestination messagerouti.. (context) - Esfahanian, Oellermann - 1993
6 A routing algorithm for networks based on distance-hereditar.. (context) - Di Stefano - 1996
6 Hamiltonian problems on distance-hereditary graphs (context) - Nicolai - 1994
5 A linear time algorithm for connected r-domination and Stein.. (context) - Brandstadt, Dragan - 1998
5 Distance hereditary graphs (context) - Howorka - 1977
4 Graphs with bounded induced distance - Cicerone, Di Stefano - 2000
3 Parallel Processing Letters (context) - Farley, Proskurowski - 1993
3 Networks with small stretch number - Cicerone, Di Stefano - 1928
2 Survivable networks with bounded delay: The edge failure cas.. (context) - Cicerone, Di Stefano et al. - 1999
2 Flammini Compact-Port routing models and applications to dis.. (context) - Cicerone, Di Stefano - 2001
1 domination and weighted k-dominating clique in distance-here.. (context) - Yeh, Chang et al. - 2001
Documents on the same site (http://dsiaq.ing.univaq.it/~cicerone/papers.html): More
Compact-Port Routing Models and Applications to.. - Cicerone, Di.. (2001) (Correct)
(k, +)-Distance-Hereditary Graphs - Cicerone, Di Stefano (Correct)
Static and Dynamic Low-Congested Interval Routing Schemes - Cicerone, Di Stefano.. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC