Efficient Enumeration of Substructures in Sparse Graphs


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:

Kazuhiro_Kurita.pdf

1.25 MB

PDF

Please use this identifier to cite or link to this item:https://doi.org/10.14943/doctoral.k14124

Related Items in HUSCAP:

Title:	Efficient Enumeration of Substructures in Sparse Graphs
Other Titles:	疎なグラフにおける部分構造の効率良い列挙
Authors:	栗田, 和宏 Browse this author
Issue Date:	25-Mar-2020
Publisher:	Hokkaido University
Conffering University:	北海道大学
Degree Report Number:	甲第14124号
Degree Level:	博士
Degree Discipline:	情報科学
Examination Committee Members:	(主査) 教授有村博紀, 教授吉岡真治, 教授 Zeugmann Thomas
Degree Affiliation:	情報科学研究科（情報理工学専攻）
Type:	theses (doctoral)
URI:	http://hdl.handle.net/2115/78409
Appears in Collections:	課程博士 (Doctorate by way of Advanced Course) > 情報科学院(Graduate School of Information Science and Technology) 学位論文 (Theses) > 博士　（情報科学）

OAI-PMH ( junii2 , jpcoar_1.0 )

- Hokkaido University