loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Parallel Computing in Electrical Engineering (PARELEC'02)
Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees
Warsaw, Poland
September 22-September 25
ISBN: 0-7695-1730-7
ASCII Text
x 
 
A. S. Nepomniaschaya, "Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees," Parallel Computing in Electrical Engineering, International Conference on, pp. 399, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002.
 
 
BibTex
x
 
@article{ 10.1109/PCEE.2002.1115307,
author = {A. S. Nepomniaschaya},
title = {Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees},
journal ={Parallel Computing in Electrical Engineering, International Conference on},
volume = {0},
year = {2002},
isbn = {0-7695-1730-7},
pages = {399},
doi = {http://doi.ieeecomputersociety.org/10.1109/PCEE.2002.1115307},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Computing in Electrical Engineering, International Conference on
TI - Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees
SN - 0-7695-1730-7
SP
EP
A1 - A. S. Nepomniaschaya,
PY - 2002
KW - null
VL - 0
JA - Parallel Computing in Electrical Engineering, International Conference on
ER -
 
A. S. Nepomniaschaya, Siberian Division of Russian Academy of Sciences
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.
Citation:
A. S. Nepomniaschaya, "Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees," parelec, pp.399, International Conference on Parallel Computing in Electrical Engineering (PARELEC'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.