메뉴 건너뛰기




Volumn 293, Issue 3, 2003, Pages 535-556

Improved shortest path algorithms for nearly acyclic graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 0037427178     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00613-8     Document Type: Conference Paper
Times cited : (7)

References (10)
  • 1
    • 0012716166 scopus 로고
    • Ph.D. Thesis, Basser Department of Computer Science, University of Sydney, Australia, July
    • D. Abuaiadh, On the complexity of the shortest path problem, Ph.D. Thesis, Basser Department of Computer Science, University of Sydney, Australia, July 1995.
    • (1995) On the Complexity of the Shortest Path Problem
    • Abuaiadh, D.1
  • 3
    • 0012648455 scopus 로고
    • Technical Report, Basser Department of Computer Science, University of Sydney, Australia, Technical Report 93-475
    • D. Abuaiadh, J. Kingston, Efficient shortest path algorithms by graph decomposition, Technical Report, Basser Department of Computer Science, University of Sydney, Australia, Technical Report 93-475, 1994.
    • (1994) Efficient Shortest Path Algorithms by Graph Decomposition
    • Abuaiadh, D.1    Kingston, J.2
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • Dijkstra E.W. A note on two problems in connexion with graphs. Numer. Math. 1:1959;269-271.
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 0023384210 scopus 로고
    • Fibonacci heaps and their uses in improved network optimisation algorithms
    • Fredman M., Tarjan R. Fibonacci heaps and their uses in improved network optimisation algorithms. J. ACM. 34(3):1987;596-615.
    • (1987) J. ACM , vol.34 , Issue.3 , pp. 596-615
    • Fredman, M.1    Tarjan, R.2
  • 7
    • 0012647739 scopus 로고    scopus 로고
    • Shortest path algorithms for nearly acyclic directed graphs
    • Takaoka T. Shortest path algorithms for nearly acyclic directed graphs. Theoret. Comput. Sci. 203(1):1998;143-150.
    • (1998) Theoret. Comput. Sci. , vol.203 , Issue.1 , pp. 143-150
    • Takaoka, T.1
  • 8
    • 84957806079 scopus 로고    scopus 로고
    • Theory of 2-3 heaps
    • in: Proc. COCOON '99
    • T. Takaoka, Theory of 2-3 heaps, in: Proc. COCOON '99, Lecture Notes in Computer Science, vol. 1627, 1999, pp. 41-50.
    • (1999) Lecture Notes in Computer Science , vol.1627 , pp. 41-50
    • Takaoka, T.1
  • 9
    • 84957002269 scopus 로고    scopus 로고
    • Theory of trinomial heaps
    • in: COCOON '00
    • T. Takaoka, Theory of trinomial heaps, in: COCOON '00, Lecture Notes in Computer Science, vol. 1858, 2000, pp. 362-372.
    • (2000) Lecture Notes in Computer Science , vol.1858 , pp. 362-372
    • Takaoka, T.1
  • 10
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • Tarjan R. Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2):1972;146-160.
    • (1972) SIAM J. Comput. , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1


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