hamiltonian_path_problem (405B)
1 # Hamiltonian path problem 2 3 The [computational_problem] of [deciding] whether an input [undirected_graph] 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 Up: [decision_problem], [hamiltonian_path] 9 10 See also: [Hamiltonian_cycle_problem]