Login / Signup

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number.

Nikola JedlickováJan Kratochvíl
Published in: CoRR (2023)
Keyphrases
  • hamiltonian cycle
  • hamiltonian path
  • genetic algorithm
  • supply chain
  • np complete
  • social network analysis
  • upper bound
  • graph theoretic
  • bounded degree