COMPUTING SETS OF SHORTEST PATHS IN A GRAPH

被引：16
|
作者：
MINIEKA, E [1 ]
机构：
[1] UNIV ILLINOIS,DEPT QUANTITAT METHODS,CHICAGO,IL 60680
来源：
COMMUNICATIONS OF THE ACM | 1974年 / 17卷 / 06期
关键词：
D O I：
10.1145/355616.364037
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：351 / 353
页数：3
相关论文
共 50 条
  • [31] Computing Approximate Shortest Paths on Convex Polytopes
    P. K. Agarwal
    S. Har-Peled
    M. Karia
    Algorithmica, 2002, 33 : 227 - 242
  • [32] Computing strictly-second shortest paths
    Lalgudi, KN
    Papaefthymiou, MC
    INFORMATION PROCESSING LETTERS, 1997, 63 (04) : 177 - 181
  • [33] Computing strictly-second shortest paths
    Yale Univ, New Haven, United States
    Inf Process Lett, 4 (177-181):
  • [34] Computing shortest paths for any number of hops
    Guérin, R
    Orda, A
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (05) : 613 - 620
  • [35] COMPUTING SHORTEST PATHS AMID CONVEX PSEUDODISKS
    Chen, Danny Z.
    Hershberger, John
    Wang, Haitao
    SIAM JOURNAL ON COMPUTING, 2013, 42 (03) : 1158 - 1184
  • [36] COMPUTING SHORTEST PATHS AND DISTANCES IN PLANAR GRAPHS
    DJIDJEV, HN
    PANTZIOU, GE
    ZAROLIAGIS, CD
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 327 - 338
  • [37] Computing Constrained Shortest-Paths at Scale
    Vera, Alberto
    Banerjee, Siddhartha
    Samaranayake, Samitha
    OPERATIONS RESEARCH, 2022, 70 (01) : 160 - 178
  • [38] Temporal shortest paths: Parallel computing implementations
    Tremblay, N
    Florian, M
    PARALLEL COMPUTING, 2001, 27 (12) : 1569 - 1609
  • [39] A Cellular Automaton that Computes Shortest Paths in Grid Graph
    Barman, Debopriya
    Das, Sukanta
    CELLULAR AUTOMATA, ACRI 2020, 2021, 12599 : 3 - 7
  • [40] INTERSECTION FUNCTIONS OF SHORTEST PATHS IN A NONDIRECTED GRAPH.
    Kishi, Genya
    Sasaki, Isao
    Electronics & communications in Japan, 1980, 63 (11): : 1 - 10
12345