100

Bibliografia

1. P. Flocchini, A. Mesa Enriques, L.Pagli, G. Principe and N.Santoro,

Efficient protocol for computing the optiamo swap edge of a shortest path tree, september 14, 2004 TCS04.

2. G. Proietti, Dynamic maintenance versus swapping: an experimental

study an shortest path trees, WAE 200, LNCS 1982, pp207-217,

2001.

3. N. Santoro, Design and analysis of distribuited algorithms, 2003 4. E. Nardelli, G. Proietti and P. Widmayer, Swapping a failing edge of a

single source shortest path tree is good and fast, Algoritmica (2003)

35: 56-74.

5. P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer and T. Zuvak, Computing All the Best Swap Edges Distributively.

6. L. Pagli, G. Prencipe, and T. Zuva, Distributed Computation for

Swapping a Failing Edge, A. Sen et al. (Eds.):IWDC 2004, LNCS

3326, pp. 28–39, 2004.

7. G. Cattaneo, P. Faruolo, U. Ferraro Petrillo, and G.F. Italiano,

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study, D. Mount and C. Stein (Eds.): ALENEX 2002, LNCS 2409, pp.

Bibliografia

101

8. H. Ito, K. Iwama, Y. Okabe, T. Yoshihiro, Polynomial-Time Computable

Backup Tables for Shortest-Path Routing, SIROCCO 10.

9. Institute of Electrical and Electronics Engineers, Inc, IEEE

Standard for Local and Metropolitan Area Networks: Media Access Control (MAC) Bridges, 9 June 2004.

10. J. F. Kurose, K. W. Ross, Computer Networking, a top-down approach

featuring the internet, Addison Wesley, 2001.

11. G. Cioffi, V. Falzone, Manuale di Informatica, Calderini, 1993. 12. M. Gr¨otschel, C.L. Monma and M. Stoer, Design of survivable

networks, Handbook in OR and MS, Vol. 7, Elsevier, Amsterdam,

1995, pp. 617–672.

13. E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of

a minimum diameter spanning tree under transient edge failures, J. Graph Algorithms Appl., 5(5) (2001), 39–57.

14. E. Nardelli, G. Proietti and P. Widmayer, How to swap a failing edge

of a single source shortest paths tree, Proc. 5th _{Annual International}

Computing and Combinatorics Conference (COCOON ’99), Vol. 1627

of Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1999, pp. 144–153.

15. K. M. Chandy, J. Misra. Distributed computation on graphs: shortest

path algorithms. Communication of ACM, 25 (833–837) 1982.

16. G. Amato, G. Cattaneo, G. F. Italiano, “Experimental Analysis of

Dynamic Minimum Spanning Tree Algorithms”, Proc. 8th Annual

ACM-SIAM Symposium on Discrete Algorithms, (1997), 5–7. 17. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to

Bibliografia

102

Siti internet di riferimento

www.eclipse.org

The Data Structures Library in Java

www.jdsl.org

Sito ufficiale del linguaggio Java