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

Takao Nishizeki, Takao Asano, Takahiro Watanabe

研究成果: Article

18 引用 (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.

元の言語English
ページ(範囲)211-222
ページ数12
ジャーナルDiscrete Applied Mathematics
5
発行部数2
DOI
出版物ステータスPublished - 1983
外部発表Yes

Fingerprint

Hamiltonians
Approximation algorithms
Walk
Planar graph
Approximation Algorithms
Traveling salesman problem
Graph in graph theory
Closed
Divide and conquer
Hamiltonian circuit
Augmentation
Travelling salesman problems
NP-complete problem
Arbitrary
Vertex of a graph

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

これを引用

An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. / Nishizeki, Takao; Asano, Takao; Watanabe, Takahiro.

:: Discrete Applied Mathematics, 巻 5, 番号 2, 1983, p. 211-222.

研究成果: Article

@article{27d2937a5db54e3a80f4968d56ba4b3f,
title = "An approximation algorithm for the hamiltonian walk problem on maximal planar graphs",
abstract = "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.",
author = "Takao Nishizeki and Takao Asano and Takahiro Watanabe",
year = "1983",
doi = "10.1016/0166-218X(83)90042-2",
language = "English",
volume = "5",
pages = "211--222",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

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

AU - Nishizeki, Takao

AU - Asano, Takao

AU - Watanabe, Takahiro

PY - 1983

Y1 - 1983

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0020707585&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020707585&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(83)90042-2

DO - 10.1016/0166-218X(83)90042-2

M3 - Article

AN - SCOPUS:0020707585

VL - 5

SP - 211

EP - 222

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 2

ER -