Art
J-GLOBAL ID:200902122492277150   Reference number:99A0772801

A Two-Stage Discrete Optimization Method for Largest Common Subgraph Problems.

最大共通部分グラフ問題に対する二段式離散最適化手法
Author (2):
Material:
Volume: E82-D  Issue:Page: 1145-1153  Publication year: Aug. 25, 1999 
JST Material Number: L1371A  ISSN: 0916-8532  Document type: Article
Article type: 原著論文  Country of issue: Japan (JPN)  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=99A0772801&from=J-GLOBAL&jstjournalNo=L1371A") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Theory of computation  ,  Basics of graph theory 
Reference (20):
more...
Terms in the title (2):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page