Associative parallel algorithms for dynamic edge update of minimum spanning trees

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

Volumn 2763, Issue , 2003, Pages 141-150

  Nepomniaschaya, A S ^a  

^a INSTITUTE OF COMPUTATIONAL MATHEMATICS AND MATHEMATICAL GEOPHYSICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

ASSOCIATIVE PROCESSING; DATA HANDLING; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS; TELECOMMUNICATION NETWORKS; TREES (MATHEMATICS);

MINIMUM SPANNING TREES; PARALLEL SYSTEM; TIME COMPLEXITY; UNDERLYING GRAPHS; VERTICAL DATA PROCESSING;

ALGORITHMS;

EID: 35248877237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45145-7_12     Document Type: Article

References (12)

1. Chin, F., Houck D.: Algorithms for Updating Minimum Spanning Trees. In: J. of Computer and System Sciences, Vol. 16 (1978) 333-344
2. Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - A Technique for Speeding Up Dynamic Graph Algorithms. In: J. of the ACM, Vol. 44, No. 5 (1997) 669-696
3. Foster, C.C.: Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)
4. Frederickson, G.: Data Structure for On-line Updating of Minimum Spanning Trees. In: SIAM J. Comput., Vol. 14 (1985) 781-798
5. Krikelis, A., Weems, C.C.: Associative Processing and Processors. IEEE Computer Society Press, Los Alamitos, California, (1997)
6. Nepomniaschaya, A.S.: Language STAR for Associative and Parallel Computation with Vertical Data Processing. In: Mirenkov, N.N. (ed.): Proc. of the Intern. Conf. "Parallel Computing Technologies", World Scientific, Singapure (1991) 258-265
7. Nepomniaschaya, A.S., Dvoskina, M.A.: A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. In: Fundamenta Informaticae, IOS Press, Vol. 43 (2000) 227-243
8. Nepomniaschaya, A.S.: Comparison of Performing the Prim-Dijkstra Algorithm and the Kruskal Algorithm on Associative Parallel Processors. In: Cybernetics and System Analysis, Kiev, Naukova Dumka, No. 2 (2000) 19-27 (in Russian. English translation by Plenum Press)
9. Pawagi, S., Kaser, O.: Optimal Parallel Algorithms for Multiple Updates of Minimum Spanning Trees. In: Algorithmica, Vol. 9 (1993) 357-381
10. Pawagi, S., Ramakrishnan, I.V.: An O(log n) Algorithm for Parallel Update of Minimum Spanning Trees. In: Inform. Process. Lett., Vol. 22 (1986) 223-229
11. Potter, J.L.: Associative Computing: A Programming Paradigm for Massively Parallel Computers. Kent State University, Plenum Press, New York and London (1992)
12. Spira, P., Pan, A.: On Finding and Updating Spanning Trees and Shortest Paths. In: SIAM J. Comput., Vol. 4 (1975) 375-380