An approximation algorithm for the hamiltonian walk problem on maximal planar graphs - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Takao Nishizeki, Takao Asano, Takahiro Watanabe. An approximation algorithm for the hamiltonian walk problem on maximal planar graphs. Discrete Applied Mathematics, 5(2):211-222, 1983. [doi]

The following publications are possibly variants of this publication:

An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graphTakao Asano, S. Kikuchi, Nobuji Saito. gta 1981: 182-195

An Approximation Algorithm for the Maximum Independent Set Problem on Planar GraphsNorishige Chiba, Takao Nishizeki, Nobuji Saito. SICOMP, 11(4):663-675, 1982.

An upper bound on the length of a Hamiltonian walk of a maximal planar graphTakao Asano, Takao Nishizeki, Takahiro Watanabe. jgt, 4(3):315-336, 1980. [doi]

runs on WebDSL