wiki_research

personal research wiki
git clone https://a3nm.net/git/wiki_research/
Log | Files | Refs

hamiltonian_path_problem (563B)

      1 # Hamiltonian path problem
      2 
      3 The [computational_problem] of [deciding] whether an input [undirected_graph] is a [Hamiltonian_graph], i.e., has a [hamiltonian_path]
      4 
      5 It is [NP_complete], but it is [FPT] [parameterized] by [treewidth]:
      6 - https://cs.stackexchange.com/questions/59325/an-fpt-algorithm-for-hamiltonian-cycle-running-parameterized-by-treewidth
      7 
      8 It is [NP_complete] even when the input is required to be a [bipartite_graph], or even a [grid_graph], cf [itai1982hamilton]
      9 
     10 Up: [decision_problem], [hamiltonian_path]
     11 
     12 See also: [Hamiltonian_cycle_problem]