IMPROVED HAMILTONIAN PATHS

被引：0
|
作者：
DUBY, JJ
机构：
来源：
COMMUNICATIONS OF THE ACM | 1968年 / 11卷 / 01期
关键词：
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：1 / &
相关论文
共 50 条
  • [31] Hamiltonian paths with prescribed edges in hypercubes
    Dvorak, Tomas
    Gregor, Petr
    DISCRETE MATHEMATICS, 2007, 307 (16) : 1982 - 1998
  • [32] The number of Hamiltonian paths in a rectangular grid
    Collins, KL
    Krompart, LB
    DISCRETE MATHEMATICS, 1997, 169 (1-3) : 29 - 38
  • [33] Strong tournaments with the fewest Hamiltonian paths
    Moon, J. W.
    Yang, Laura L. M.
    UTILITAS MATHEMATICA, 2007, 72 : 193 - 198
  • [34] Finding Hamiltonian paths in tournaments on clusters
    Huang, Chun-Hsi
    Rajasekaran, Sanguthevar
    Yang, Laurence Tianruo
    He, Xin
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2006, 9 (03): : 345 - 353
  • [35] On the maximum number of Hamiltonian paths in tournaments
    Adler, I
    Alon, N
    Ross, SM
    RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) : 291 - 296
  • [36] Absolute differences along Hamiltonian paths
    Monopoli, Francesco
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (03)
  • [37] Noncrossing Hamiltonian paths in geometric graphs
    Cerny, J
    Dvorák, Z
    Jelínek, V
    Kára, J
    GRAPH DRAWING, 2004, 2912 : 86 - 97
  • [38] Hamiltonian paths and cycles in Fibonacci cubes
    Zelina, Ioana
    CARPATHIAN JOURNAL OF MATHEMATICS, 2008, 24 (01) : 149 - 155
  • [39] About Hamiltonian paths and chain metric
    Burdyuk, V.Ya.
    Kakhichko, A.A.
    Kibernetika i Sistemnyj Analiz, 2001, (03): : 184 - 195
  • [40] Finding Hamiltonian paths in tournaments on clusters
    Chun-Hsi Huang
    Sanguthevar Rajasekaran
    Laurence Tianruo Yang
    Xin He
    Cluster Computing, 2006, 9 : 345 - 353
12345