Skip to main content
SpringerLink
Log in

Networks with Small Stretch Number (Extended Abstract)

  • Conference paper
  • First Online:
Graph-Theoretic Concepts in Computer Science (WG 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1928))

Included in the following conference series:

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 ∈ BID(k) is called stretch number of G. In this paper we give new characterization, algorithmic, and existence results about graphs with small stretch number.

Work partially supported by the Italian MURST Project “Teoria dei Grafi ed Applicazioni”. Part of this work has been done while the first author, supported by the DFG, was visiting the Department of Computer Science, University of Rostock, Germany.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. J. Bandelt and M. Mulder. Distance-hereditary graphs. Journal of Combinatorial Theory, Series B, 41(2):182–208, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Brandstädt, V. B. Le and J. P. Spinrad. Graph classes-a survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.

    Google Scholar 

  3. A. Brandstädt and F. F. Dragan. A linear time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs. Networks, 31:177–182, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Bruck, R. Cypher, and C.-T. Ho. Fault-tolerant meshes with small degree. SIAM J. on Computing, 26(6):1764–1784, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. Cicerone and G. Di Stefano. Graph classes between parity and distance-hereditary graphs. Discrete Applied Mathematics, 95(1-3): 197–216, August 1999.

    Article  MATH  MathSciNet  Google Scholar 

  6. S. Cicerone, G. Di Stefano, and M. Flammini Compact-Port routing models and applications to distance-hereditary graphs. In 6th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO’99), pages 62–77, Carleton Scientific, 1999.

    Google Scholar 

  7. S. Cicerone and G. Di Stefano. Graphs with bounded induced distance. In Proc. 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG’98, pages 177–191. Lecture Notes in Computer Science, vol. 1517, Springer-Verlag, 1998. To appear on Discrete Applied Mathematics.

    Google Scholar 

  8. S. Cicerone, G. Di Stefano, and D. Handke. Survivable networks with bounded delay: The edge failure case (Extended Abstract). In Proc. 10th Annual International Symp. Algorithms and Computation, ISAAC’99, pages 205–214. Lecture Notes in Computer Science, vol. 1741, Springer-Verlag, 1999.

    Google Scholar 

  9. W. H. Cunningham. Decomposition of directed graphs. SIAM Jou. on Alg. Disc. Meth., 3:214–228, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. D’Atri and M. Moscarini. Distance-hereditary graphs, steiner trees, and connected domination. SIAM Journal on Computing, 17:521–530, 1988.

    Article  MathSciNet  Google Scholar 

  11. G. Di Stefano. A routing algorithm for networks based on distance-hereditary topologies. In 3rd Int. Coll. on Structural Inform. and Communication Complexity (SIROCCO’96), Carleton Scientific, 1996.

    Google Scholar 

  12. F. F. Dragan. Dominating cliques in distance-hereditary graphs. In 4th Scandinavian Workshop on Algorithm Theory (SWAT’94), volume 824 of Lecture Notes in Computer Science, pages 370–381. Springer-Verlag, 1994.

    Google Scholar 

  13. A. H. Esfahanian and O. R. Oellermann. Distance-hereditary graphs and multidestination message-routing in multicomputers. Journal of Comb. Math. and Comb. Computing, 13:213–222, 1993.

    MATH  MathSciNet  Google Scholar 

  14. A. M. Farley and A. Proskurowski. Self-repairing networks. Paral. Proces. Letters, 3(4):381–391, 1993.

    Article  MathSciNet  Google Scholar 

  15. J. P. Hayes. A graph model for fault-tolerant computing systems. IEEE Transactions on Computers, C-25(9):875–884, 1976.

    Article  MathSciNet  Google Scholar 

  16. P. L. Hammer and F. Maffray. Completely separable graphs. Discr. Appl. Mathematics, 27:85–99, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  17. F. Harary. Graph Theory. Addison-Wesley, 1969.

    Google Scholar 

  18. E. Howorka. Distance hereditary graphs. Quart. J. Math. Oxford, 2(28):417–420, 1977.

    Article  MathSciNet  Google Scholar 

  19. F. T. Leighton, B. M. Maggs, and R. K. Sitaraman. On the fault tolerance of some popular bounded-degree networks. SIAM J. on Computing, 27(6):1303–1333, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  20. F. Nicolai. Hamiltonian problems on distance-hereditary graphs. Technical Report SM-DU-264, University Duisburg, 1994.

    Google Scholar 

  21. D. Peleg and A. Schaffer. Graph spanners. Journal of Graph Theory, 13:99–116, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  22. J. van Leeuwen and R.B. Tan. Interval routing. The Computer Journal, 30:298–307, 1987.

    Article  MATH  Google Scholar 

  23. H. G. Yeh and G. J. Chang. Weighted connected domination and steiner trees in distance-hereditary graphs. In 4th Franco-Japanese and Franco-Chinese Conference on Combinatorics and Computer Science, volume 1120 of Lecture Notes in Computer Science, pages 48–52. Springer-Verlag, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria Elettrica, Università dell’Aquila, Monteluco di Roio, 67040, L’Aquila, Italy

    Serafino Cicerone & Gabriele Di Stefano

Authors
  1. Serafino Cicerone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gabriele Di Stefano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Konstanz, Box D 188, 78457, Konstanz, Germany

    Ulrik Brandes  & Dorothea Wagner  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicerone, S., Di Stefano, G. (2000). Networks with Small Stretch Number (Extended Abstract). In: Brandes, U., Wagner, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2000. Lecture Notes in Computer Science, vol 1928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40064-8_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-40064-8_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41183-3

  • Online ISBN: 978-3-540-40064-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation