EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN PLANAR DIRECTED-GRAPHS

被引：0

|

作者：

LINGAS, A

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 450卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：447 / 457

页数：11

相关论文

共 50 条

[1] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS
LUCAS, JM
SACKROWITZ, MG
SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES, 1989, : 369 - 378
[2] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS
LUCAS, JM
SACKROWITZ, MG
ALGORITHMICA, 1992, 7 (5-6) : 631 - 648
[3] OPTIMAL PARALLEL ALGORITHMS FOR PATH PROBLEMS ON PLANAR GRAPHS
SRIKRISHNA, G
RANGAN, CP
THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 27 - 43
[4] ALGORITHMS FOR DIRECTED-GRAPHS
MANGANO, SR
DR DOBBS JOURNAL, 1994, 19 (04): : 92 - &
[5] IMPROVED PROCESSOR BOUNDS FOR PARALLEL ALGORITHMS FOR WEIGHTED DIRECTED-GRAPHS
AMATO, N
INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 147 - 152
[6] PARALLEL ALGORITHMS FOR MINIMAL SPANNING-TREES OF DIRECTED-GRAPHS
ZHANG, YX
INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1989, 18 (03) : 205 - 221
[7] SOLUTION OF ASSIGNMENT PROBLEMS BY DIRECTED-GRAPHS
SUITS, DB
JOURNAL OF FARM ECONOMICS, 1957, 39 (04): : 975 - 983
[8] AN EFFICIENT PARALLEL ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN DENSE DIRECTED-GRAPHS
FURER, M
RAGHAVACHARI, B
JOURNAL OF ALGORITHMS, 1995, 18 (02) : 203 - 220
[9] DEVELOPMENT OF SEVERAL REACHABILITY ALGORITHMS FOR DIRECTED-GRAPHS
BERGHAMMER, R
EHLER, H
ZIERER, H
LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 206 - 218
[10] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS
GABOW, HN
GALIL, Z
SPENCER, T
TARJAN, RE
COMBINATORICA, 1986, 6 (02) : 109 - 122

← 1 2 3 4 5 →