• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs.

Takao NishizekiTakao AsanoTakahiro Watanabe
Published in: Discret. Appl. Math. (1983)
Keyphrases
  • computational complexity
  • np hard
  • dynamic programming
  • worst case
  • linear programming
  • closed form
  • objective function
  • optimal solution
  • k means
  • least squares
  • probabilistic inference
  • max cut