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 条
  • [21] Finding Shortest Paths Between Graph Colourings
    Matthew Johnson
    Dieter Kratsch
    Stefan Kratsch
    Viresh Patel
    Daniël Paulusma
    Algorithmica, 2016, 75 : 295 - 321
  • [22] A PARALLEL ALGORITHM FOR THE PROBLEM OF SHORTEST PATHS ON A GRAPH
    LISTROVOY, SV
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1991, 29 (03): : 60 - 66
  • [23] TRIPLE ALGORITHM FOR DETERMINATION OF SHORTEST PATHS IN A GRAPH
    HAMMER, G
    ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1969, 12 (02): : 153 - &
  • [24] Finding Shortest Paths Between Graph Colourings
    Johnson, Matthew
    Kratsch, Dieter
    Kratsch, Stefan
    Patel, Viresh
    Paulusma, Daniel
    PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 221 - 233
  • [25] COVERING OF GRAPH BY A SYSTEM OF THE SHORTEST SIMPLE PATHS
    IUSHMANOV, SV
    DOKLADY AKADEMII NAUK SSSR, 1982, 266 (06): : 1303 - 1305
  • [26] Finding Shortest Paths Between Graph Colourings
    Johnson, Matthew
    Kratsch, Dieter
    Kratsch, Stefan
    Patel, Viresh
    Paulusma, Daniel
    ALGORITHMICA, 2016, 75 (02) : 295 - 321
  • [27] Finding next-to-shortest paths in a graph
    Krasikov, I
    Noble, SD
    INFORMATION PROCESSING LETTERS, 2004, 92 (03) : 117 - 119
  • [28] A New Algorithm for the Shortest Paths of Sparse Graph
    He, Zongtao
    Li, Tianzhi
    2015 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND INTELLIGENT CONTROL (ISIC 2015), 2015, : 498 - 503
  • [29] A NOTE ON COMPUTING SHORTEST PATHS WITH LOGISTIC CONSTRAINTS
    Crainic, Teodor Gabriel
    Florian, Michael
    TRANSPORTATION AND THE ECONOMY, 2005, : 259 - 267
  • [30] Computing approximate shortest paths on convex polytopes
    Agarwal, PK
    Har-Peled, S
    Karia, A
    ALGORITHMICA, 2002, 33 (02) : 227 - 242
12345