메뉴 건너뛰기




Volumn 36, Issue 11, 2009, Pages 2892-2898

Finding non-dominated bicriteria shortest pairs of disjoint simple paths

Author keywords

Bicriteria; Disjoint paths; Ranking algorithms; Shortest simple paths

Indexed keywords

BICRITERIA; COMPUTATIONAL RESULTS; DISJOINT PATHS; PATH RANKINGS; RANKING ALGORITHMS; SHORTEST SIMPLE PATHS;

EID: 64549095942     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.01.002     Document Type: Article
Times cited : (11)

References (11)
  • 2
    • 0015955981 scopus 로고
    • Disjoint paths in a network
    • Suurballe J. Disjoint paths in a network. Networks 4 (1974) 125-145
    • (1974) Networks , vol.4 , pp. 125-145
    • Suurballe, J.1
  • 3
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • Suurballe J., and Tarjan R. A quick method for finding shortest pairs of disjoint paths. Networks 14 (1984) 325-336
    • (1984) Networks , vol.14 , pp. 325-336
    • Suurballe, J.1    Tarjan, R.2
  • 7
    • 34147120474 scopus 로고
    • 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.1
  • 8


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