Access count of this item: 71

Files in This Item:
File Description SizeFormat 
0397-9.pdf1.31 MBAdobe PDFView/Open
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNISHIZEKI, TAKAOja
dc.contributor.authorASANO, TAKAOja
dc.contributor.authorWATANABE, TAKAHIROja
dc.date.accessioned2010-03-08T02:23:17Z-
dc.date.available2010-03-08T02:23:17Z-
dc.date.issued1980-09ja
dc.identifier.issn1880-2818ja
dc.identifier.urihttp://hdl.handle.net/2433/105036-
dc.format.mimetypeapplication/pdfja
dc.language.isoengja
dc.publisher京都大学数理解析研究所ja
dc.subject.ndc410ja
dc.titleAn Approximation Algorithm for the Hamiltonian Walk Problem on Maximal Planar Graphs (Graphs and Combinatorics III)ja
dc.type.niitypeDepartmental Bulletin Paperja
dc.identifier.ncidAN00061013ja
dc.identifier.jtitle数理解析研究所講究録ja
dc.identifier.volume397ja
dc.identifier.spage156ja
dc.identifier.epage178ja
dc.textversionpublisherja
dc.sortkey09ja
dc.addressFaculty of Engineering, Tohoku Universityja
dc.addressFaculty of Engineering, Tohoku Universityja
dc.addressR&D Center, Toshiba Corporationja
Appears in Collections:Graphs and Combinatorics 3

Show simple item record

Export to RefWorks


Export Format: 


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