Advanced search: Search from
Select basic information for advanced search
| Free word |
|---|
| Copy service |  |
|---|---|
| Related links |  |
Art
J-GLOBAL ID：201202233846411480
Reference number：12A0924171 Constant Amortized Time Enumeration of Bounded-Size Subtrees in Trees
木に含まれる限定サイズ部分木の列挙
- Publisher site Copy service
- Access JDreamⅢ for advanced search and analysis.
WASA KUNIHIRO
About WASA KUNIHIRO
(北大 大学院情報科学研究科)
, About 北大 大学院情報科学研究科
UNO TAKEAKI
About UNO TAKEAKI
(国立情報学研)
, About 国立情報学研
ARIMURA HIROKI
About ARIMURA HIROKI
(北大 大学院情報科学研究科)
About 北大 大学院情報科学研究科
Material：
電子情報通信学会技術研究報告
(IEICE Technical Report (Institute of Electronics, Information and Communication Engineers))
About 電子情報通信学会技術研究報告
Volume： 112 Issue： 24(COMP2012 8-11) Page： 25-32 Publication year： May. 07, 2012
JST Material Number： S0532B ISSN： 0913-5685 Document type： Proceedings
Article type： 短報 Country of issue： Japan (JPN) Language： JAPANESE (JA)
Thesaurus term：
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
*tree (graph)
, About tree (graph)
discovery
, About discovery
data
, About data
vertex
, About vertex
subject
, About subject
*extraction
About extraction
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
*pattern mining
, About pattern mining
pattern discovery
, About pattern discovery
motif
, About motif
semistructured data
, About semistructured data
*subtree
About subtree
JST classification (1)：
JST classification
Category name(code) classified by JST.
Basics of graph theory
Category name(code) classified by JST.
(IA02020S)
About Basics of graph theory
Reference (15)：
- ABITEBOUL, S. Data on the Web : From Relations to Semistructured Data and XML. 1999
- ARIMURA, H. Polynomial-delay and polynomial-space algorithms for mining closed sequences, graphs, and pictures in accessible set systems. Proc. SDM'09. 2009, 1087-1098
- ASAI, T. Efficient substructure discovery from large semi-structured data. SDM, 2002. 2002
- AVIS, D. Reverse search for enumeration. Discrete Applied Mathematics. 1993, 65, 21-46
- CORMEN, T. H. Introduction to Algorithms. 2001
Terms in the title (3)：
Terms in the title
Keywords automatically extracted from the title.
Keywords automatically extracted from the title.
木
, About 木
サイズ
, About サイズ
部分木
About 部分木
Return to Previous Page
