A study on the computational complexity of graph isomorphism counting problems

Notes on use

Search by Bookstore

You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.

Material Type: 博士論文
Title: A study on the computational complexity of graph isomorphism counting problems
Author/Editor: Takayuki Nagoya [著]
Author Heading: 名古屋, 孝幸ナゴヤ, タカユキ
Publication, Distribution, etc.: [Takayuki Nagoya]
Publication Date: 2002
Publication Date (W3CDTF): 2002
Extent: 1冊
Alternative Title: グラフ同型写像数え上げ問題の計算量に関する研究グラフドウケイシャゾウカゾエアゲモンダイノケイサンリョウニカンスルケンキュウ
Degree grantor/type: 電気通信大学
Date Granted: 平成14年9月27日
Date Granted (W3CDTF): 2002
Dissertation Number: 甲第282号
Degree Type: 博士 (理学)
Note (Dissertation): 博士論文
Place of Publication (Country Code): JP
Text Language Code: eng
NDLC: UT51
Note (General): 博士論文
Holding library: 国立国会図書館
Call No.: UT51-2003-C5
Data Provider (Database): 国立国会図書館 : 国立国会図書館蔵書
https://ndlsearch.ndl.go.jp
Bibliographic ID (NDL): 000004084353
http://id.ndl.go.jp/bib/000004084353
Bibliographic Record Category (NDL): 213