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 条
  • [41] Shortest paths in the Tower of Hanoi graph and finite automata
    Romik, Dan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2006, 20 (03) : 610 - 622
  • [42] Tweet Integration by Finding the Shortest Paths on a Word Graph
    Huyen Trang Phan
    Dinh Tuyen Hoang
    Ngoc Thanh Nguyen
    Hwang, Dosam
    MODERN APPROACHES FOR INTELLIGENT INFORMATION AND DATABASE SYSTEMS, 2018, 769 : 87 - 97
  • [43] PLANAR GRAPH DECOMPOSITION AND ALL PAIRS SHORTEST PATHS
    FREDERICKSON, GN
    JOURNAL OF THE ACM, 1991, 38 (01) : 162 - 204
  • [44] Multiple Source Shortest Paths in a Genus g Graph
    Cabello, Sergio
    Chambers, Erin W.
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 89 - +
  • [45] The number of shortest paths in the (n, k)-star graph
    Cheng, Eddie
    Qiu, Ke
    Shen, Zhizhang
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (04)
  • [46] Computing the n x m shortest paths efficiently
    Shibuya, T
    ALGORITHM ENGINEERING AND EXPERIMENTATION, 1999, 1619 : 210 - 225
  • [47] An improved approximation algorithm for computing geometric shortest paths
    Aleksandrov, L
    Maheshwari, A
    Sack, JR
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 2003, 2751 : 246 - 257
  • [48] DISTRIBUTED ALGORITHMS FOR COMPUTING SHORTEST PAIRS OF DISJOINT PATHS
    OGIER, RG
    RUTENBURG, V
    SCHACHAM, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (02) : 443 - 455
  • [49] Computing Shortest Paths among Curved Obstacles in the Plane
    Chen, Danny Z.
    Wang, Haitao
    PROCEEDINGS OF THE TWENTY-NINETH ANNUAL SYMPOSIUM ON COMPUTATIONAL GEOMETRY (SOCG'13), 2013, : 369 - 378
  • [50] Shortest paths between shortest paths
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5205 - 5210
12345