AN IMPROVED PARALLEL ALGORITHM THAT COMPUTES THE BFS NUMBERING OF A DIRECTED GRAPH

被引:53
作者
GAZIT, H
MILLER, GL
机构
[1] Univ of Southern California, Los, Angeles, CA, USA, Univ of Southern California, Los Angeles, CA, USA
关键词
* This research was supported in part by the National Science Foundation under Grant No. DCR-8514961;
D O I
10.1016/0020-0190(88)90164-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:61 / 65
页数:5
相关论文
共 5 条
[1]  
Aho A.V., 2000, The design and analysis of computer algorithms
[2]  
Baase S, 1983, COMPUTER ALGORITHMS
[3]  
Pan Victor, 1984, How to multiply matrices faster
[4]   GAUSSIAN ELIMINATION IS NOT OPTIMAL [J].
STRASSEN, V .
NUMERISCHE MATHEMATIK, 1969, 13 (04) :354-&
[5]  
[No title captured]