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


Hokkaido University \| Library \| HUSCAP	Advanced Search		言語

	Home
	About HUSCAP
	Open Access Policy

	Browse by Author

Browse
	Communities & Collections

	Scholarly Journals
	Theses
	Doctoral Dissertations Listed by Graduate Schools
	Conference Procs.
	Events

	HUSCAP Senior (in Japanese)

	Societies

	Downloads (country)

For university staff
	How to post your papers to HUSCAP
	Publication of theses
	Helpline about theses publication

Open Archives Compliant

You can search our collection also at:
	Google
	Google Scholar
	CiNii
	IRDB
	OAIster
	NDLTD

Files in This Item:

157_59-70.pdf

564.85 kB

PDF

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:	加地, 太一¹ Browse this author
Authors:	大内, 東² Browse this author
Authors(alt):	Kaji, Taichi¹
Authors(alt):	Ohuchi, Azuma²
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

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University