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 条
  • [1] VISIBILITIES AND SETS OF SHORTEST PATHS IN A CONNECTED GRAPH
    NEBESKY, L
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 1995, 45 (03) : 563 - 570
  • [2] COMMENT ON COMPUTING K SHORTEST PATHS IN A GRAPH
    LAWLER, EL
    COMMUNICATIONS OF THE ACM, 1977, 20 (08) : 603 - 604
  • [3] Shortest Paths between Shortest Paths and Independent Sets
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 56 - +
  • [4] Shortest paths on a polyhedron .1. Computing shortest paths
    Chen, JD
    Han, YJ
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1996, 6 (02) : 127 - 144
  • [5] Computing shortest paths with uncertainty
    Feder, Tomas
    Motwani, Rajeev
    O' Callaghan, Liadan
    Olston, Chris
    Panigrahy, Rina
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2007, 62 (01): : 1 - 18
  • [6] Computing Almost Shortest Paths
    Elkin, Michael
    ACM TRANSACTIONS ON ALGORITHMS, 2005, 1 (02) : 283 - 323
  • [7] Computing shortest paths with uncertainty
    Feder, T
    Motwani, R
    O'Callaghan, L
    Olston, C
    Panigrahy, R
    STACS 2003, PROCEEDINGS, 2003, 2607 : 367 - 378
  • [8] COMPUTING SHORTEST TRANSVERSALS OF SETS
    Bhattacharya, Binay
    Czyzowicz, Jurek
    Egyed, Peter
    Toussaint, Godfried
    Stojmenovic, Ivan
    Urrutia, Jorge
    INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1992, 2 (04) : 417 - 435
  • [9] SHORTEST PATHS IN GRAPHS OF CONVEX SETS
    Marcucci, Tobia
    Umenberger, Jack
    Parrilo, Pablo
    Tedrake, Russ
    SIAM JOURNAL ON OPTIMIZATION, 2024, 34 (01) : 507 - 532
  • [10] The number of shortest paths in the arrangement graph
    Cheng, Eddie
    Grossman, Jerrold W.
    Qiu, Ke
    Shen, Zhizhang
    INFORMATION SCIENCES, 2013, 240 : 191 - 204
12345