DocumentCode :
335600
Title :
Finding strongly connected components in series parallel graphs
Author :
Afrati, Foto
Author_Institution :
National Technical University of Athens
Volume :
3
fYear :
1991
fDate :
28-30 Aug 1991
Firstpage :
17
Lastpage :
27
Keywords :
Computational modeling; Concurrent computing; Databases; Logic; Parallel algorithms; Phase change random access memory; Polynomials; TV; Transmission line matrix methods; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON '91.1991 IEEE Region 10 International Conference on EC3-Energy, Computer, Communication and Control Systems
Print_ISBN :
0-7803-0538-8
Type :
conf
DOI :
10.1109/TENCON.1991.753831
Filename :
753831
Link To Document :
بازگشت