INTERSECTION FUNCTIONS OF SHORTEST PATHS IN A NONDIRECTED GRAPH.

被引:0
|
作者
Kishi, Genya
Sasaki, Isao
机构
来源
Electronics & communications in Japan | 1980年 / 63卷 / 11期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
7
引用
收藏
页码:1 / 10
相关论文
共 50 条
  • [41] PROCEDURE FOR PARTITIONING THE NODES OF A GRAPH.
    Anon
    IBM technical disclosure bulletin, 1986, 28 (09): : 4030 - 4034
  • [42] Auction algorithm for shortest paths in road networks considering delays for intersection movements
    Du M.
    Cheng L.
    Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2010, 45 (02): : 249 - 254
  • [43] IDENTIFYING TEST FOR A NONDIRECTED GRAPH
    DANILOV, VV
    FILIMONOV, BI
    AUTOMATION AND REMOTE CONTROL, 1973, 34 (07) : 1175 - 1178
  • [44] MEASURE OF THE QUALITY OF CONNECTION IN A DIRECTED GRAPH.
    McAllister, Marialuisa N.
    1987, : 157 - 166
  • [45] Shortest Paths between Shortest Paths and Independent Sets
    Kaminski, Marcin
    Medvedev, Paul
    Milanic, Martin
    COMBINATORIAL ALGORITHMS, 2011, 6460 : 56 - +
  • [46] Generation of Trees of a Linear Graph.
    Bator, Jerzy
    Archiwum Elektrotechniki (Warsaw), 1975, 24 (02): : 263 - 276
  • [47] Shortest Paths with Shortest Detours
    Torchiani, Carolin
    Ohst, Jan
    Willems, David
    Ruzika, Stefan
    JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2017, 174 (03) : 858 - 874
  • [48] Developments in the theory of randomized shortest paths with a comparison of graph node distances
    Kivimaki, Ilkka
    Shimbo, Masashi
    Saerens, Marco
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 393 : 600 - 616
  • [49] Nonempty intersection of longest paths in a graph with a small matching number
    Chen, Fuyuan
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2015, 65 (02) : 545 - 553
  • [50] Nonempty intersection of longest paths in a graph with a small matching number
    Fuyuan Chen
    Czechoslovak Mathematical Journal, 2015, 65 : 545 - 553