弱連結成分抽出によるグラフ理論的クラスター分析アルゴリズムの検討


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:

138_23-34.pdf

586.4 kB

PDF

Please use this identifier to cite or link to this item:http://hdl.handle.net/2115/42063

Title:	弱連結成分抽出によるグラフ理論的クラスター分析アルゴリズムの検討
Other Titles:	Graph-theoretic Cluster Analysis Algorithms Based on the Concept of Weak Connected Components of a Digraph
Authors:	大内, 東¹ Browse this author
	加地, 郁夫² Browse this author
	栗原, 浩一³ Browse this author
Authors(alt):	Ohuchi, Azuma¹
	Kaji, Ikuo²
	Kurihara, Khoichi³
Issue Date:	30-Jan-1988
Publisher:	北海道大学
Journal Title:	北海道大學工學部研究報告
Journal Title(alt):	Bulletin of the Faculty of Engineering, Hokkaido University
Volume:	138
Start Page:	23
End Page:	33
Type:	bulletin (article)
URI:	http://hdl.handle.net/2115/42063
Appears in Collections:	北海道大学工学部研究報告 = Bulletin of the Faculty of Engineering, Hokkaido University > No.138

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University