OPTIMAL PATHS IN GRAPHS WITH STOCHASTIC OR MULTIDIMENSIONAL WEIGHTS

被引:0
|
作者
HENIG, M
机构
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:1242 / 1243
页数:2
相关论文
共 50 条
  • [31] Optimal construction of edge-disjoint paths in random graphs
    Broder, AZ
    Frieze, AM
    Suen, S
    Upfal, E
    SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 542 - 574
  • [32] Optimal computation of shortest paths on doubly convex bipartite graphs
    FRL, P.O. Box 18345, Los Angeles, CA 90018, United States
    Comput Math Appl, 3 (1-12):
  • [33] Near-optimal induced universal graphs for cycles and paths
    Abrahamsen, Mikkel
    Alstrup, Stephen
    Holm, Jacob
    Knudsen, Mathias Baek Tejs
    Stockel, Morten
    DISCRETE APPLIED MATHEMATICS, 2020, 282 : 1 - 13
  • [34] Optimal Embedding of Graphs with Nonconcurrent Longest Paths in Archimedean Tessellations
    Nadeem, Muhammad Faisal
    Shabbir, Ayesha
    Imran, Muhammad
    COMPLEXITY, 2023, 2023
  • [35] On finding globally optimal paths through weighted colored graphs
    Wooden, David
    Egerstedt, Magnus
    PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14, 2006, : 1948 - 1953
  • [36] A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs
    Bernstein, Aaron
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 742 - 755
  • [37] Optimal paths in multi-stage stochastic decision networks
    Roohnavazfar, Mina
    Manerba, Daniele
    De Martin, Juan Carlos
    Tadei, Roberto
    OPERATIONS RESEARCH PERSPECTIVES, 2019, 6
  • [38] Paths in graphs
    Bollobás, B
    Sarkar, A
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2001, 38 : 115 - 137
  • [39] Algorithms for optimal min hop and foremost paths in interval temporal graphs
    Jain, Anuj
    Sahni, Sartaj K.
    APPLIED NETWORK SCIENCE, 2022, 7 (01)
  • [40] Algorithms for optimal min hop and foremost paths in interval temporal graphs
    Anuj Jain
    Sartaj K. Sahni
    Applied Network Science, 7