Login / Signup

Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path.

Benjamin Momège
Published in: SOFSEM (2017)
Keyphrases
  • sufficient conditions
  • hamiltonian path
  • graph theoretic
  • connected components
  • linear complementarity problem
  • asymptotic stability
  • fixed point
  • linear systems
  • efficiently computable
  • optimal policy
  • lyapunov function