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

Takao Nishizeki, Takao Asano, Takahiro Watanabe

Research output: Contribution to journalArticle

18 Citations (Scopus)


A hamiltonian walk of a graph is a shortest closed walk that passes through every vertex at least once, and the length is the total number of traversed edges. The hamiltonian walk problem in which one would like to find a hamiltonian walk of a given graph is NP-complete. The problem is a generalized hamiltonian cycle problem and is a special case of the traveling salesman problem. Employing the techniques of divide-and-conquer and augmentation, we present an approximation algorithm for the problem on maximal planar graphs. The algorithm finds, in O(p2) time, a closed spanning walk of a given arbitrary maximal planar graph, and the length of the obtained walk is at most 3 2(p - 3) if the graph has p (≥ 9) vertices. Hence the worst-case bound is 3 2.

Original languageEnglish
Pages (from-to)211-222
Number of pages12
JournalDiscrete Applied Mathematics
Issue number2
Publication statusPublished - 1983 Feb


ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this