SOME LOCATION PROBLEMS ON GRID GRAPHS.

被引：0
|
作者：
Yamaguchi, Tadashi
Kaji, Ikuo
机构：
来源：
Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi) | 1987年 / 70卷 / 10期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
5
引用
收藏
页码：31 / 40
相关论文
共 50 条
  • [41] Set graphs. II. Complexity of set graph recognition and similar problems
    Milanic, Martin
    Rizzi, Romeo
    Tomescu, Alexandru I.
    THEORETICAL COMPUTER SCIENCE, 2014, 547 : 70 - 81
  • [42] NODE-GRACEFUL GRAPHS.
    Harary, Frank
    Hsu, D.Frank
    Computers & mathematics with applications, 1986, 15 (04): : 291 - 298
  • [43] CONNECTIONIST NETWORKS QUA GRAPHS.
    Partridge, D.
    Computers & mathematics with applications, 1986, 15 (04): : 325 - 331
  • [44] Cuts in Undirected Graphs. II
    F. Sharifov
    L. Hulianytskyi
    Cybernetics and Systems Analysis, 2020, 56 : 745 - 752
  • [45] COPS AND ROBBERS IN GRAPHS WITH LARGE GIRTH AND CAYLEY GRAPHS.
    Frankl, Peter
    1600, (17):
  • [46] Some results related to the toughness of 3-domination critical graphs. II
    Ananchuen, Nawarat
    Plummer, Michael D.
    UTILITAS MATHEMATICA, 2006, 70 : 11 - 32
  • [47] Parallel community detection for massive graphs.
    Riedy, E. Jason
    Meyerhenke, Henning
    Ediger, David
    Bader, David A.
    GRAPH PARTITIONING AND GRAPH CLUSTERING, 2013, 588 : 207 - +
  • [48] Virtual screening using reduced graphs.
    Gillet, VJ
    ABSTRACTS OF PAPERS OF THE AMERICAN CHEMICAL SOCIETY, 2004, 228 : U362 - U363
  • [49] Summing all the eikonal graphs. II
    H. M. Fried
    Y. Gabellini
    The European Physical Journal C - Particles and Fields, 2003, 32 : 55 - 65
  • [50] Frequency domain analysis with bond graphs.
    Vera, C
    Mera, JM
    PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON BOND GRAPH MODELING AND SIMULATION (ICBGM'99), 1999, 31 (01): : 136 - 140
12345