SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Algorithmica (New York)

Volumn 20, Issue 3, 1998, Pages 309-318

Subcubic cost algorithms for the all Pairs shortest path problem

(1) Takaoka, T a,b

a IBARAKI UNIVERSITY (Japan)

b UNIVERSITY OF CANTERBURY (New Zealand)

Author keywords

All pairs shortest path problem; General cost problem; Parallel algorithm; Two phase algorithm; Unit cost problem

Indexed keywords

EID: 0042113503 PISSN: 01784617 EISSN: None Source Type: Journal
DOI: 10.1007/PL00009198 Document Type: Article

Times cited : (46)

References (13)

1
- 0026375767
- On the exponent of the all pairs shortest path problem
- N. Alon, Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, Proc. 32nd IEEE FOCS (1991), pp. 569-575.
- (1991) Proc. 32nd IEEE FOCS , pp. 569-575
- Alon, N.¹ Galil, Z.² Margalit, O.³

2
- 84969333008
- Witnesses for Boolean matrix multiplication and for shortest paths
- N. Alon, Z. Galil, O. Margalit, and M. Naor, Witnesses for Boolean matrix multiplication and for shortest paths, Proc. 33rd IEEE FOCS (1992), pp. 417-426.
- (1992) Proc. 33rd IEEE FOCS , pp. 417-426
- Alon, N.¹ Galil, Z.² Margalit, O.³ Naor, M.⁴

3
- 85023205150
- Matrix multiplication via arithmetic progressions
- D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251-280.
- (1990) J. Symbolic Comput. , vol.9 , pp. 251-280
- Coppersmith, D.¹ Winograd, S.²

4
- 0000456144
- Parallel matrix and graph algorithms
- E. Dekel, D. Nassimi, and S. Sahni, Parallel matrix and graph algorithms, SIAM J. Comput. 10 (1981), 657-675.
- (1981) SIAM J. Comput. , vol.10 , pp. 657-675
- Dekel, E.¹ Nassimi, D.² Sahni, S.³

5
- 84945709831
- Algorithm 97: Shortest path
- R. W. Floyd, Algorithm 97: Shortest path, Comm. ACM 5(6) (1962), 345.
- (1962) Comm. ACM , vol.5 , Issue.6 , pp. 345
- Floyd, R.W.¹

6
- 0346444539
- New bounds on the complexity of the shortest path problem
- M. L. Fredman, New bounds on the complexity of the shortest path problem, SIAM J. Comput. 5 (1976), 49-60.
- (1976) SIAM J. Comput. , vol.5 , pp. 49-60
- Fredman, M.L.¹

7
- 0024031890
- An improved parallel algorithm that computes the bfs numbering of a directed graph
- H. Gazit and G. Miller, An improved parallel algorithm that computes the bfs numbering of a directed graph, Inform. Process. Lett. 28 (1988), 61-65.
- (1988) Inform. Process. Lett. , vol.28 , pp. 61-65
- Gazit, H.¹ Miller, G.²

8
- 0004257527
- Cambridge University Press, Cambridge
- A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University Press, Cambridge (1988).
- (1988) Efficient Parallel Algorithms
- Gibbons, A.¹ Rytter, W.²

9
- 0026993243
- Efficient parallel algorithms for computing all pairs shortest paths in directed graphs
- Y. Han, V. Pan, and J. Reif, Efficient parallel algorithms for computing all pairs shortest paths in directed graphs, Proc. 4th ACM SPAA (1992), pp. 353-362.
- (1992) Proc. 4th ACM SPAA , pp. 353-362
- Han, Y.¹ Pan, V.² Reif, J.³

10
- 0040540546
- Shortest-path problem is not harder than matrix multiplications
- F. Romani, Shortest-path problem is not harder than matrix multiplications, Inform. Process. Lett. 11 (1980), 134-136.
- (1980) Inform. Process. Lett. , vol.11 , pp. 134-136
- Romani, F.¹

11
- 34250459760
- Schnelle Multiplikation Großer Zahlen
- A. Schönhage and V. Strassen, Schnelle Multiplikation Großer Zahlen, Computing 7 (1971), 281-292.
- (1971) Computing , vol.7 , pp. 281-292
- Schönhage, A.¹ Strassen, V.²

12
- 19944376069
- On the all-pairs-shortest-path problem
- R. Seidel, On the all-pairs-shortest-path problem, Proc. 24th ACM STOC (1990), pp. 213-223.
- (1990) Proc. 24th ACM STOC , pp. 213-223
- Seidel, R.¹

13
- 0001586202
- A new upperbound on the complexity of the all pairs shortest path problem
- T. Takaoka, A new upperbound on the complexity of the all pairs shortest path problem, Inform. Process. Lett. 43 (1992), 195-199.
- (1992) Inform. Process. Lett. , vol.43 , pp. 195-199
- Takaoka, T.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.