Art
J-GLOBAL ID:201302240586600120
Reference number:13A0456466
Computational complexity of computing a partial solution for the Graph Automorphism problems
グラフ自己同型問題に対する部分解計算の計算量
-
Publisher site
Copy service
-
Access JDreamⅢ for advanced search and analysis.
Author (2):
,
Material:
Volume:
410
Issue:
21-23
Page:
2064-2071
Publication year:
2009
JST Material Number:
O6284A
ISSN:
0304-3975
Document type:
Article
Country of issue:
Other (ZZZ)
Language:
ENGLISH (EN)
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.
,
,
,
,
Return to Previous Page