Computing a diameter-constrained minimum spanning tree in parallel

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1767, Issue , 2000, Pages 17-31

  Deo, Narsingh ^a   Abdalla, Ayman ^a  

^a University of Central Florida   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS;

APPROXIMATE SOLUTION; CONSTRAINED MINIMUM SPANNING TREE; DISTRIBUTED MUTUAL EXCLUSION ALGORITHMS; EDGE-WEIGHTED GRAPH; MASSIVELY PARALLELS; MINIMUM SPANNING TREES; PARALLEL IMPLEMENTATIONS; TREE CONSTRUCTION ALGORITHMS;

TREES (MATHEMATICS);

EID: 84912115381     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46521-9_2     Document Type: Article

References (14)

1. Abdalla, A., Deo, N., Fraceschini, R.: Parallel heuristics for the diameter-constrained MST problem. Congressus Numerantium, (1999) (to appear)
2. Abdalla, A., Deo, N., Kumar, N., Terry, T.: Parallel computation of a diameter-constrained MST and related problems. Congressus Numerantium, Vol. 126.(1997) 131-155
3. Achuthan, N.R., Caccetta, L., Caccetta, P., Geelen, J.F: Algorithms for the minimum weight spanning tree with bounded diameter problem. Optimization: Techniques and Applications, (1992) 297-304
4. Bala, K., Petropoulos, K., Stern,T.E.: Multicasting in a Linear Lightwave Network. IEEE INFOCOM '93, Vol. 3. (1993) 1350-1358
5. Chow, R., Johnson, T.: Distributed Operating Systems and Algorithms. Addison-Wesley, Reading, MA (1997)
6. Deo N., Kumar, K.: Constrained Spanning Tree Problems: Approximate Methods and Parallel Computation. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 40. (1998) 191-217
7. Garey, M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP- Completeness. W.H. Freeman, San Francisco (1979)
8. Moret, B.M.E., Shapiro, H.D.: An empirical analysis of algorithms for constructing a minimum spanning tree. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 15. (1994) 99-117
9. P.W. Paddock.: Bounded Diameter Minimum Spanning Tree Problem, M.S. Thesis, George Mason University, Fairfax, VA (1984)
10. Palmer., E.M.: Graph Evolution: An Introduction to the Theory of Random Graphs, John - Wiley & Sons, Inc., New York (1985)
11. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, Vol. 7. No. 1. (1989) 61-77
12. Satyanarayanan, R., Muthukrishnan, D.R.: A note on Raymond's tree-based algorithm for distributed mutual exclusion. Information Processing Letters, Vol. 43. (1992) 249-255
13. Satyanarayanan, R., Muthukrishnan, D.R.: A static-tree-based algorithm for the distributed readers and writers problem. Computer Science and Informatics, Vol. 24. No.2. (1994) 21-32
14. Wang, S, Lang, S.D.: A tree-based distributed algorithm for the k-entry critical section problem. In: Proceedings of the 1994 International Conference on Parallel and Distributed Systems, (1994) 592-597