Art
J-GLOBAL ID:200902000024996095   Reference number:90A0511954

Tree-structured maximal common subgraph searching. An example of parallel computation with a single sequential processor.

最大共通部分構造の木構造探索 単一の逐次処理装置を用いる平行計算の一例
Author (2):
Material:
Volume:Issue:Page: 177-202  Publication year: 1989 
JST Material Number: T0653A  ISSN: 0898-5529  CODEN: TCMEET  Document type: Article
Article type: 解説  Country of issue: United Kingdom (GBR)  Language: ENGLISH (EN)
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.
,...
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.

   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=90A0511954&from=J-GLOBAL&jstjournalNo=T0653A") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Numerical computation 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page