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

Active Bibliography

13 I/O-Efficient Algorithms for Shortest Path Related Problems – Norbert Ralf Zeh - 2002
A Parallel Algorithm for Approximating the Minimum Cycle Cover – Philip Klein, Clifford Stein
6 Fully Dynamic Planarity Testing with Applications – Zvi Galil, et al.
7 Error-Resilient Optimal Data Compression – James A. Storer, John, John H. Reif, Siam J. Comput C - 1997
70 Symmetry Breaking In Distributed Networks – Alon Itai, Michael Rodeh - 1981
Asymptotic Rate Limits for Randomized Broadcasting with Network Coding – Di Niu, Baochun Li
Duality, Nowhere-Zero Flows, Colorings and Cycle Covers – J. Nesetril, A. Raspaud - 1999
On Conflict-Free All-to-All Broadcast in One-Hop Optical Networks of Arbitrary Topologies – Stefan Alex, Ru Pascu, Ahmed A. El-amawy, Senior Member
8 A fast algorithm for computing steiner edge connectivity – Ramesh Hariharan - 2003
Note on circular flows of graphs – Hong-jian Lai, Rui Xu, Cun-quan Zhang
Procurement in Truckload Transportation – Gultekin Kuyzu - 2007
2 Shipper collaboration – Özlem Ergun, Gültekin Kuyzu, Martin Savelsbergh - 2007
RUSSIAN ACADEMY OF SCIENCES – A. V. Kostoch Ka, Ins Ti, Tute F Ma, Thema Tlcs, Sib €ria N Branch, Novosibirsk R Ussla
1 A Characterisation of Weakly Four-Connected Graphs – Tibor Jordán, Technical Reports - 2003
3 Two-connected orientations of Eulerian graphs – Technical Reports, Tibor Jordán, Alex R. Berg, Alex R. Berg - 2004
1 A Note on Mixed Graphs and Directed Splitting Off – Steffen Enni - 1994
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Recent Results on Well-Balanced Orientations – Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti, Attila Bernáth, Satoru Iwata, Tamás Király, Zoltán Király, Zoltán Szigeti - 2006
11 Deterministic O(nm) Time Edge-Splitting in Undirected Graphs – Hiroshi Nagamochi, Toshihide Ibaraki - 1997
13 On the orientation of graphs and hypergraphs – András Frank, Tamás Király, Zoltán Király - 2001