The Multi-Tree Approach to Reliability in Distributed Networks (1984)

Cached

Download Links

by Alon Itai , Michael Rodeh
Venue:Information and Computation
Citations:59 - 1 self

Documents Related by Co-Citation

33 Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs – J Cheriyan, S N Maheshwari - 1988
25 Three tree-paths – A Zehavi, A Itai - 1989
108 An algorithm for planarity testing of graphs – A Lempel, S Even, I Cederbaum - 1966
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
35 Cooperative Packet Caching and Shortest Multipath Routing In Mobile Ad hoc Networks – Alvin Valera, Winston Seah, S.V. Rao, Sv Rao - 2003
291 Split Multi-path Routing with Maximally Disjoint Paths in Ad Hoc Networks – Sung-ju Lee
644 Routing of multipoint connections – B M Waxman - 1988
17 Independent trees in graphs – A Huck - 1994
96 An efficient parallel biconnectivity algorithm – R E Tarjan, U Vishkin - 1985
62 Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge redundant graphs – M Medard, S G Finn, R A Barry, R G Gallager - 1999
5 Disproof of a conjecture about independent branchings in kconnected directed graphs – A Huck - 1995
342 Graph Algorithms – S Even - 1979
42 Rubber bands, convex embeddings and graph connectivity – N Linial, L Lovász, A Wigderson - 1988
10 On independent spanning trees – S Khuller, B Schieber - 1992
29 Finding disjoint paths in networks – D Sidhu, R Nair, S Abdallah - 1991
1132 Graph Theory – F Harary - 1969
178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
18 Scan-first search and sparse certificates: an improved parallel algorithm for k-connectivity – J Cheriyan, M Kao, R Thurimella - 1993
89 A Framework for Reliable Routing in Mobile Ad Hoc Networks – Zhenqiang Ye, Srikanth V. Krishnamurthy, Satish K. Tripathi - 2003