Access count of this item: 69

Files in This Item:
File Description SizeFormat 
0397-9.pdf1.31 MBAdobe PDFView/Open
Title: An Approximation Algorithm for the Hamiltonian Walk Problem on Maximal Planar Graphs (Graphs and Combinatorics III)
Authors: NISHIZEKI, TAKAO
ASANO, TAKAO
WATANABE, TAKAHIRO
Issue Date: Sep-1980
Publisher: 京都大学数理解析研究所
Journal title: 数理解析研究所講究録
Volume: 397
Start page: 156
End page: 178
URI: http://hdl.handle.net/2433/105036
Appears in Collections:Graphs and Combinatorics 3

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.