Directional routing via generalized st-numberings

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 2, 2000, Pages 268-279

  Annexstein, Fred S ^a   Berman, Kenneth A ^a  

^a UNIVERSITY OF CINCINNATI   (United States)

Author keywords

Graph connectivity; Matchings; Network routing; st numbering

Indexed keywords

EID: 1842686733     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198333290     Document Type: Article

References (15)

1. F.S. ANNEXSTEIN, K.A. BERMAN, AND R. SWAMINATHAN, A multi-tree generating routing scheme using acyclic orientations, in Computing and Combinatorics, Proceedings of the Third Annual International Conference, Lecture Notes in Comput. Sci. 1279, Springer-Verlag, New York, 1997, pp. 18-22.
2. F. BAO, Y. IGARASHI, AND S.R. OHRING, Reliable broadcasting in product networks, Discrete Appl. Math., 83 (1998), pp. 3-20.
3. D. BERTSEKAS AND R. GALLAGER, Data Networks, Prentice-Hall, New York, 1992.
4. J. CHERIYAN AND S.N. MAHESHWARI, Finding non-separating induced cycles and independent spanning trees in 3-connected graphs, J. Algorithms, 9 (1988), pp. 507-537.
5. J. CHERIYAN AND J. REIF, Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity, Combinatorica, 14 (1994), pp. 435-451.
6. R. COHEN, B.V. PATEL, F. SCHAFFA, AND M WILLEBEEK-LEMAIR, The sink tree paradigm: Connectionless traffic support on ATM LAN's, IEEE/ACM Trans. on Networking, 4 (1996), pp. 363-374.
7. T. CORMAN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, McGraw-Hill, New York, 1994.
8. S. EVEN AND R.E. TARJAN, Computing an st-numbering, Theoret Comput. Sci., 2 (1976), pp. 339-344.
9. A. HUCK, Disproof of a conjecture about independent branchings in k-connected directed graphs, J. Graph Theory, 20 (1995), pp. 235-239.
10. A. ITAI AND M. RODEH, The multi-tree approach to reliability in distributed networks, Inform. and Comput., 79 (1988), pp. 43-59.
11. A. LEMPEL, S. EVEN, AND I. CEDERBAUM, An algorithm for planarity testing graphs, in Theory of Graphs, P. Rosentiehl, ed., Gordon and Breach, New York, 1966, pp. 215-232.
12. N. LINIAL, L. LOVÁSZ, AND A. WIGDERSON, Rubber bands, convex embeddings, and graph connectivity, Combinatorica, 8 (1988), pp. 91-102.
13. A. SCHRIJVER, Fractional packing and covering, in Packing and Covering in Combinatorics, A. Schrijver, ed., Mathematical Centre Tracts 106, Mathematisch Centrum, Amsterdam, 1979, pp. 201-274.
14. W.T. TUTTE, A theory of 3-connected graphs, Indag. Math. (N.S.), 23 (1961), pp. 441-455.
15. A. ZEHAVI AND A. ITAI, Three tree-paths, J. Graph Theory, 13 (1989), pp. 175-188.