INCLUSION AND EXCLUSION ALGORITHM FOR THE HAMILTONIAN PATH PROBLEM

被引：38
|
作者：
BAX, ET
机构：
[1] Department of Computer Science, Furman University, Greenville
来源：
INFORMATION PROCESSING LETTERS | 1993年 / 47卷 / 04期
关键词：
COMBINATORIAL PROBLEMS; HAMILTONIAN PATH PROBLEM; NP PROBLEMS; GRAPH THEORY;
D O I：
10.1016/0020-0190(93)90033-6
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper contains a description of an algorithm that uses the principle of inclusion and exclusion to determine the number of Hamiltonian paths in a given graph that have a given starting vertex and a given ending vertex, and it also contains a description of a similar algorithm to determine the number of Hamiltonian cycles in a given graph. The algorithms have an upper bound on time complexity of O(2n x n4) where n is the number of vertices in the graph. Also, the algorithms require only O(n3 log2 n) bits of storage space.
引用
收藏
页码：203 / 207
页数：5
相关论文
共 50 条
  • [1] A SUCCESSFUL ALGORITHM FOR THE UNDIRECTED HAMILTONIAN PATH PROBLEM
    THOMPSON, GL
    SINGHAL, S
    DISCRETE APPLIED MATHEMATICS, 1985, 10 (02) : 179 - 195
  • [2] A DNA algorithm for the Hamiltonian path problem using microfluidic systems
    Ledesma, L
    Pazos, J
    Rodríguez-Patón, A
    ASPECTS OF MOLECULAR COMPUTING: ESSAYS DEDICATED TO TOM HEAD ON THE OCCASION OF HIS 70TH BIRTHDAY, 2004, 2950 : 289 - 296
  • [3] An approximate algorithm for the weighted Hamiltonian path completion problem on a tree
    Wu, QS
    Lu, CL
    Lee, RCT
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 156 - 167
  • [4] A linear time algorithm for the Hamiltonian path problem on a series-parallel graph
    Wu, QS
    Lee, RCT
    Chao, KM
    PROCEEDINGS OF THE FIFTH JOINT CONFERENCE ON INFORMATION SCIENCES, VOLS 1 AND 2, 2000, : 531 - 534
  • [5] DNA computing the Hamiltonian path problem
    Lee, CM
    Kim, SW
    Kim, SM
    Sohn, U
    MOLECULES AND CELLS, 1999, 9 (05) : 464 - 469
  • [6] Metaheuristics for the Asymmetric Hamiltonian Path Problem
    Pedroso, Joao Pedro
    NUMERICAL METHODS AND APPLICATIONS, 2011, 6046 : 272 - 279
  • [7] Nanopore decoding for a Hamiltonian path problem
    Takiguchi, Sotaro
    Kawano, Ryuji
    NANOSCALE, 2021, 13 (12) : 6192 - 6200
  • [8] Degree conditions and path factors with inclusion or exclusion properties
    Zhou, Sizhong
    BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE, 2023, 66 (01): : 3 - 14
  • [9] A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
    Wu, Jun
    Cheng, Yongxi
    Yang, Zhen
    Chu, Feng
    OPERATIONS RESEARCH LETTERS, 2023, 51 (05) : 473 - 476
  • [10] SOLUTION OF THE KNIGHTS HAMILTONIAN PATH PROBLEM ON CHESSBOARDS
    CONRAD, A
    HINDRICHS, T
    MORSY, H
    WEGENER, I
    DISCRETE APPLIED MATHEMATICS, 1994, 50 (02) : 125 - 134
12345