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 条
  • [1] Shortest paths in intersection graphs of unit disks
    Cabello, Sergio
    Jejcic, Miha
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (04): : 360 - 367
  • [2] COMPUTING SETS OF SHORTEST PATHS IN A GRAPH
    MINIEKA, E
    COMMUNICATIONS OF THE ACM, 1974, 17 (06) : 351 - 353
  • [3] The number of shortest paths in the arrangement graph
    Cheng, Eddie
    Grossman, Jerrold W.
    Qiu, Ke
    Shen, Zhizhang
    INFORMATION SCIENCES, 2013, 240 : 191 - 204
  • [4] OPTIMUM SET OF PATHS WHICH PASS ALL ARCS OF A GRAPH.
    Masuyama, Hiroshi
    Ichimori, Tetsuo
    Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E, 1986, E69 (01): : 6 - 8
  • [5] VERTEX ELIMINATION ALGORITHM FOR ENUMERATING ALL SIMPLE PATHS IN A GRAPH.
    Fratta, L.
    Montanari, U.
    Networks, 1975, 5 (02): : 151 - 177
  • [6] Intersection of longest paths in graph classes
    Cerioli, Marcia R.
    Lima, Paloma T.
    DISCRETE APPLIED MATHEMATICS, 2020, 281 : 96 - 105
  • [7] Decomposing a graph into shortest paths with bounded eccentricity
    Birmele, Etienne
    de Montgolfier, Fabien
    Planche, Leo
    Viennot, Laurent
    DISCRETE APPLIED MATHEMATICS, 2020, 284 (284) : 353 - 374
  • [8] 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
  • [9] Finding Shortest Paths Between Graph Colourings
    Matthew Johnson
    Dieter Kratsch
    Stefan Kratsch
    Viresh Patel
    Daniël Paulusma
    Algorithmica, 2016, 75 : 295 - 321
  • [10] TRIPLE ALGORITHM FOR DETERMINATION OF SHORTEST PATHS IN A GRAPH
    HAMMER, G
    ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1969, 12 (02): : 153 - &
12345