HUSCAP logo Hokkaido Univ. logo

Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Engineering / Faculty of Engineering >
北海道大学工学部研究報告 = Bulletin of the Faculty of Engineering, Hokkaido University >
No.157 >

動的計画法による最適系列グラフ分割アルゴリズムの計算量解析

Files in This Item:
157_59-70.pdf564.85 kBPDFView/Open
Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/42294

Title: 動的計画法による最適系列グラフ分割アルゴリズムの計算量解析
Other Titles: Complexity of Optimal Sequential Partitions of Graphs by Dynamic Programming
Authors: 加地, 太一1 Browse this author
大内, 東2 Browse this author
Authors(alt): Kaji, Taichi1
Ohuchi, Azuma2
Issue Date: 16-Oct-1991
Publisher: 北海道大学
Journal Title: 北海道大學工學部研究報告
Journal Title(alt): Bulletin of the Faculty of Engineering, Hokkaido University
Volume: 157
Start Page: 59
End Page: 70
Type: bulletin (article)
URI: http://hdl.handle.net/2115/42294
Appears in Collections:北海道大学工学部研究報告 = Bulletin of the Faculty of Engineering, Hokkaido University > No.157

Export metadata:

OAI-PMH ( junii2 , jpcoar )

MathJax is now OFF:


 

 - Hokkaido University