Constrained length connectivity and survivable networks

Networks

Volumn 36, Issue 1, 2000, Pages 17-33

  Ameur, Walid Ben ^a  

^a ORANGE LABS   (France)

Author keywords

Connectivity; Container theory; Fault tolerance; Graphs; Length constraints; Telecommunications

Indexed keywords

EID: 0034239439     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200008)36:1<17::AID-NET3>3.0.CO;2-Z     Document Type: Article

References (21)

1. [1] R.K. Ahuga, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. th Network Planning Symp, Sydney, Australia, Nov. 1996, pp. 263-268.
3. [3] W. Ben Ameur, Design of minimum cost networks, Working paper, 1999.
4. [4] W. Ben Ameur, New classes of 2-connected graphs and survivable networks, SIAM Discr Math 98.
5. [5] C. Berge, Theory of graphs and its applications, Mathnen, London.
6. [6] J.C. Bermond, J. Bond, M. Paoli, and C. Peyrat, Surveys in combinatorics. British Combinatorial Conf, 1983.
7. [7] B. Bollabos, Extremal graph theory, Academic Press, New York, 1978.
8. [8] B. Bollabos and S. Eldridge, On graphs with diameter 2, J Combin Theory Ser B 21 (1976), 201-205.
9. th Hungarian Colloquim on Combinatorics (Eger, 81), Janos Bolyai Math. Soc., 1983.
10. [10] R. Diestel, Graph theory, Springer, 1997.
11. [11] R.C. Entringer, D.E. Jackson, and P.J. Slater, Geodetic connectivity of graphs, IEEE Trans Circuits Syst Cas-24 (1977), 460-463.
12. [12] R.J. Faudree, E.T. Ordman, R.H. Shelp, M.S. Jacobson, and Z. Tuza, Menger's theorem and short paths, J Combin Math Combin Comp 2 (1987), 235-253.
13. [13] B. Fortz, M. Labbé, and F. Maffioli, Solving the two-connected network with bounded meshes problem, Oper Res, (to appear).
14. [14] M. Gondran and M. Minoux, Graphes et algorithmes, Eyrolles, 1995.
15. [15] D.F. Hsu, On container width and length in graphs, groups, and networks, IEICE Trans Fundam E77(4) (1994), 668-680.
16. [16] D.F. Hsu and T. Luczak, Note on the k-diameter of k-regular k-connected graphs, Discr Math 132 (1994), 291-296.
17. [17] T.C. Hu, Integer Programming and Network Flows, Addison-Wesley, Reading, MA, 1969.
18. [18] A. Itai, Y. Perl, and Y. Shiloach, The complexity of finding maximum disjoint path with length constraints, Networks 12 (1982), 277-286.
19. [19] M.S. Krishnamoorty and B. Krishnamurthy, Fault diameter of interconnection networks, Comput Math Appl 13(516) (1987), 577-582.
20. [20] L. Lovász, V. Neumann-Lara, and M. Plummer, Mengerian theorems for paths of bounded length, Period Math Hung (1978), 269-276.
21. [21] U.S.R. Murty, On some extremal graphs, Acta Math Acad Sci Hung 19 (1968), 69-74.