EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS

被引：0

|

作者：

LUCAS, JM

SACKROWITZ, MG

机构：

来源：

SPAA 89: PROCEEDINGS OF THE 1989 ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES | 1989年

关键词：

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

收藏

页码：369 / 378

页数：10

相关论文

共 50 条

[1] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN DIRECTED-GRAPHS
LUCAS, JM
SACKROWITZ, MG
[J]. ALGORITHMICA, 1992, 7 (5-6) : 631 - 648
[2] EFFICIENT PARALLEL ALGORITHMS FOR PATH PROBLEMS IN PLANAR DIRECTED-GRAPHS
LINGAS, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 450 : 447 - 457
[3] ALGORITHMS FOR DIRECTED-GRAPHS
MANGANO, SR
[J]. DR DOBBS JOURNAL, 1994, 19 (04): : 92 - &
[4] PARALLEL ALGORITHMS FOR MINIMAL SPANNING-TREES OF DIRECTED-GRAPHS
ZHANG, YX
[J]. INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING, 1989, 18 (03) : 205 - 221
[5] IMPROVED PROCESSOR BOUNDS FOR PARALLEL ALGORITHMS FOR WEIGHTED DIRECTED-GRAPHS
AMATO, N
[J]. INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 147 - 152
[6] AN EFFICIENT PARALLEL ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN DENSE DIRECTED-GRAPHS
FURER, M
RAGHAVACHARI, B
[J]. JOURNAL OF ALGORITHMS, 1995, 18 (02) : 203 - 220
[7] SOLUTION OF ASSIGNMENT PROBLEMS BY DIRECTED-GRAPHS
SUITS, DB
[J]. JOURNAL OF FARM ECONOMICS, 1957, 39 (04): : 975 - 983
[8] DEVELOPMENT OF SEVERAL REACHABILITY ALGORITHMS FOR DIRECTED-GRAPHS
BERGHAMMER, R
EHLER, H
ZIERER, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 314 : 206 - 218
[9] EFFICIENT ALGORITHMS FOR FINDING MINIMUM SPANNING-TREES IN UNDIRECTED AND DIRECTED-GRAPHS
GABOW, HN
GALIL, Z
SPENCER, T
TARJAN, RE
[J]. COMBINATORICA, 1986, 6 (02) : 109 - 122
[10] COMPLEXITY OF PROBLEMS RELATIVE TO ACYCLIC DIRECTED-GRAPHS
BORDAT, JP
[J]. RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1987, 21 (02): : 181 - 197

← 1 2 3 4 5 →