The Community for Technology Leaders
International Conference on Parallel Computing in Electrical Engineering (PARELEC'02) (2002)
Warsaw, Poland
Sept. 22, 2002 to Sept. 25, 2002
ISBN: 0-7695-1730-7
pp: 399
A. S. Nepomniaschaya , Siberian Division of Russian Academy of Sciences
ABSTRACT
In this paper, by means of an abstract model of the SIMD type with vertical data processing (the STAR-machine), we present a simple associative parallel algorithm for finding tree paths in undirected graphs. We study applications of this algorithm to update minimum spanning trees in undirected graphs, to determine maximum flow values in a multiterminal network, and to find a fundamental set of circuits with respect to a given spanning tree. These algorithms are given as the corresponding STAR procedures whose correctness is proved and time complexity is evaluated.
INDEX TERMS
null
CITATION

A. S. Nepomniaschaya, "Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees," International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)(PARELEC), Warsaw, Poland, 2002, pp. 399.
doi:10.1109/PCEE.2002.1115307
92 ms
(Ver 3.3 (11022016))