SCOPUS 정보 검색 플랫폼

Volumn 32, Issue 3, 2005, Pages 509-520

An algorithm for ranking quickest simple paths

Author keywords

Graph theory; Network; Paths ranking; Quickest path; Simple path

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; GRAPHIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

PATHS RANKING; QUICKEST PATH; SIMPLE PATH;

GRAPH THEORY;

EID: 4744365712 PISSN: 03050548 EISSN: None Source Type: Journal
DOI: 10.1016/S0305-0548(03)00250-8 Document Type: Article

Times cited : (63)

References (11)

1
- 0016952840
- On the fastest route for convoy-type traffic in flowrate-constrained networks
- Moore M.H. On the fastest route for convoy-type traffic in flowrate-constrained networks. Transportation Science. 10:1976;113-124.
- (1976) Transportation Science , vol.10 , pp. 113-124
- Moore, M.H.¹

2
- 0025228171
- The quickest path problem
- Chen Y.L., Chin Y.H. The quickest path problem. Computers & Operations Research. 17(2):1990;153-161.
- (1990) Computers & Operations Research , vol.17 , Issue.2 , pp. 153-161
- Chen, Y.L.¹ Chin, Y.H.²

3
- 0025862824
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Rosen J.B., Sun S.Z., Xue G.L. Algorithms for the quickest path problem and the enumeration of quickest paths. Computers & Operations Research. 18(6):1991;571-584.
- (1991) Computers & Operations Research , vol.18 , Issue.6 , pp. 571-584
- Rosen, J.B.¹ Sun, S.Z.² Xue, G.L.³

4
- 0000652817
- An algorithm for the quickest path problem
- Martins E.Q.V., Santos J.L.E. An algorithm for the quickest path problem. Operations Research Letters. 20:1997;195-198.
- (1997) Operations Research Letters , vol.20 , pp. 195-198
- Martins, E.Q.V.¹ Santos, J.L.E.²

5
- 0027617231
- On the quickest path problem
- Chen G.-.H., Hung Y.-.C. On the quickest path problem. Information Processing Letters. 46(3):1993;125-128.
- (1993) Information Processing Letters , vol.46 , Issue.3 , pp. 125-128
- Chen, G.-H.¹ Hung, Y.-C.²

6
- 0027264315
- An algorithm for finding the K quickest paths in a network
- Chen Y.L. An algorithm for finding the. K quickest paths in a network Computers & Operations Research. 20:1993;59-65.
- (1993) Computers & Operations Research , vol.20 , pp. 59-65
- Chen, Y.L.¹

8
- 0028416914
- Finding the K quickest simple paths in a network
- Chen Y.L. Finding the. K quickest simple paths in a network Information Processing Letters. 50:1994;89-92.
- (1994) Information Processing Letters , vol.50 , pp. 89-92
- Chen, Y.L.¹

9
- 0000663732
- Finding the K shortest loopless paths in a network
- Yen J.Y. Finding the. K shortest loopless paths in a network Management Science. 17:1971;712-716.
- (1971) Management Science , vol.17 , pp. 712-716
- Yen, J.Y.¹

10
- 0020292250
- An efficient algorithm for K shortest simple paths
- Katoh N., Ibaraki T., Mine H. An efficient algorithm for. K shortest simple paths Networks. 12:1982;411-427.
- (1982) Networks , vol.12 , pp. 411-427
- Katoh, N.¹ Ibaraki, T.² Mine, H.³

11
- 34147120474
- A note on two problems in connection with graphs
- Dijkstra E. A note on two problems in connection with graphs. Numerical Mathematics. 1:1959;269-271.
- (1959) Numerical Mathematics , vol.1 , pp. 269-271
- Dijkstra, E.¹

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