OPTIMAL PATHS IN GRAPHS WITH STOCHASTIC OR MULTIDIMENSIONAL WEIGHTS

被引：0
|
作者：
HENIG, M
机构：
来源：
COMMUNICATIONS OF THE ACM | 1985年 / 28卷 / 11期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1242 / 1243
页数：2
相关论文
共 50 条
  • [41] Optimal construction of edge-disjoint paths in random regular graphs
    Frieze, AM
    Zhao, L
    COMBINATORICS PROBABILITY & COMPUTING, 2000, 9 (03): : 241 - 263
  • [42] Optimal weights decoding of M-ary suprathreshold stochastic resonance in stochastic pooling network
    Zhou, Bingchang
    Wang, Xuelin
    Qi, Qianqian
    CHINESE JOURNAL OF PHYSICS, 2018, 56 (04) : 1718 - 1726
  • [43] Optimal construction of edge-disjoint paths in random regular graphs
    Frieze, AM
    Zhao, L
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 346 - 355
  • [44] A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs
    Lim, Jaein
    Tsiotras, Panagiotis
    2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 7503 - 7509
  • [45] Optimal parallel algorithm for shortest-paths problem on interval graphs
    MISHRA P.K.
    Journal of Zhejiang University Science, 2004, (09) : 129 - 137
  • [46] Optimal parallel algorithm for shortest paths problem on interval graphs.
    Mishra P.K.
    Journal of Zhejiang University-SCIENCE A, 2004, 5 (9): : 1135 - 1143
  • [47] Node-to-set disjoint paths with optimal length in star graphs
    Gu, QP
    Peng, ST
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1997, E80D (04) : 425 - 433
  • [48] Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
    Mikko Lauri
    Aino Ropponen
    Risto Ritala
    Annals of Mathematics and Artificial Intelligence, 2017, 79 : 337 - 370
  • [49] Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering
    Lauri, Mikko
    Ropponen, Aino
    Ritala, Risto
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2017, 79 (04) : 337 - 370
  • [50] Shortest paths with ordinal weights
    Schaefer, Luca E.
    Dietz, Tobias
    Froehlich, Nicolas
    Ruzika, Stefan
    Figueira, Jose R.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 280 (03) : 1160 - 1170
12345