Distributed verification of minimum spanning trees

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 26-34

  Korman, Amos ^a   Kutten, Shay ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed algorithms; Graph property verification; Labeling schemes; Minimum Spanning Tree; Network algorithms; Proof labeling; Self stabilization

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; SENSITIVITY ANALYSIS;

DISTRIBUTED ALGORITHMS; GRAPH PROPERTY VERIFICATION; LABELING SCHEMES; MINIMUM SPANNING TREE (MST); NETWORK ALGORITHMS; PROOF LABELING; SELF STABILIZATION;

TREES (MATHEMATICS);

EID: 33748706344     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146389     Document Type: Conference Paper

References (29)

1. Y. Afek, S. Kutten, and M. Yung. The Local Detection Paradigm and its Applications to Self Stabilization. Theoretical Computer Science, Vol. 186, No. 1-2, pages 199-230, 1997.
2. B. Awerbuch and G. Varghese. Distributed Program Checking: a Paradigm for Building Self-Stabilizing Distributed Protocols. Proc., IEEE POCS 1991, pages 258-267.
3. I. Cidon, I. Gopal, M. Kaplan, and S. Kutten. A Distributed Control Architecture of High-Speed Networks. IEEE Transactions oil Communications, Vol. 43, No. 5, pp. 1950-1960, May 1995.
4. S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C. Liu, and L. Wei. Protocol Independent Multicast (PIM): Motivation and Architecture. Internet Draft draft-ietf-pim-arch-01.ps, January 1995.
5. B. Dixon, M. Ranch, and R. E. Tarjan. Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM Journal on Computing, Vol. 21, No 6, pages 1184-1192, December 1992.
6. B. Dixon and R. E. Tarjan. Optimal Parallel Verification of Minimum Spanning Trees in Logarithmic Time. Algorithmica Issue: Volume 17, Number 1, pages 11-18, January 1997.
7. S. Dolev, M. G. Gouda, and M. Schnieider. Memory requirements for silent stabilization. Acta Information, Vol. 36, Issue 6, October 1999, pages 447-462.
8. P. Fraigniaud and C. Gavoille. Routing in trees. In Proc. 28th Int. Colloq. on Automata, Languages & Prog., LNCS 2076, pages 757-772, July 2001.
9. M.L. Fredman and D.E. Willard. Trans-Dichotomous algorithms for minimum spanning trees and shortest paths. Proc. 31st IEEE FOCS, Los Alamitos, CA, 1990, pages 719-725.
10. R.G. Gallager, P.A. Humblet, P.M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Programming Languages and Systems, 5 (1983) 66-77.
11. C. Gavoille, M. Katz, N.A. Katz, C. Paul and D. Peleg. Approximate Distance Labeling Schemes. In 9th European Symp. on Algorithms, Aug. 2001, Aarhus, Denmark, SV-LNCS 2161, 476-488.
12. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in graphs. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pages 210-219, Jan. 2001.
13. D. Harel. A linear Time Algorithm for Finding Dominators in Flow Graphs and Related Problems. Proc. 17th ACM STOC, Salem, MA, 1985, pages 18-194.
14. M. Jayaram, G. Varghese. The Complexity of Crash Failures. Proc ACM PODC 1997, pages 179-188.
15. M. Jayaram, G. Varghese. Crash Failures Can Drive Protocols to Arbitrary States. Proc ACM PODC 1996, pages 247-256.
16. S. Kannan, M. Naor, and S. Rudich. Implicit representation of graphs. In SIAM J. on Descrete Math 5, (1992), 596-603.
17. M. Katz, N.A. Katz, A. Korman, and D. Peleg. Labeling schemes for flow and connectivity. In Proc. 19th ACM-SIAM Symp. on Discrete Algorithms, Jan. 2002.
18. D. R. Karger, P.N. Klein, and R.E. Tarjan. A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. JACM Vol. 42, No. 2, pages 3210328, 1955.
19. J. Koml'os. Linear verification for spanning trees. Combinatorica, 5 (1985), pages 57-65.
20. A. Korman, S. Kutten, and D. Peleg. Proof Labeling Schemes. Proc. the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), Las Vegas, NV, USA, July 2005.
21. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets, and Applications. Journal of Algorithms 28(1), pages 40-66 (1998).
22. V. King. A simpler minimum spanning tree verification algorithm. Algorithmica (1997) 18: 263-270.
23. V. King, C.K Poon, V. Ramachandran, S. Sinha. An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification. IPL 62(3): 153-159, 1997.
24. R. E. Tarjan. Sensitivity Analysis of Minimum Spanning Trees and Shortest Paths Trees. Information Processing Letters, 14 (1982), Pages 30-33; Corrigendum, Ibid. 23 (1986) page 219.
25. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, USA, 1983.
26. F. Kuhn and R. Watenhoffer. Constant Time Distributed Dominating Set Approximation. Distributed Computing 17(4) 303-310 (2005).
27. F. Kuhn, T. Moscibroda, and R. Watenhoffer. What cannot be computed locally! ACM PODC 2004, pages 300-309.
28. S Pettie and V. Ramachandran. An optimal minimum spanning tree algorithm. JACM 49(1): 16-34 (2002).
29. E. E. Tarjan. Applications of path compression on balanced trees. JACM 26 (1979), pages 690715.