Art
J-GLOBAL ID:200902245959740415   Reference number:07A0726293

A More Efficient Algorithm for Finding a Maximum Clique with an Improved Approximate Coloring

改良型近似彩色を用いた最大クリーク発見のためのより効率的なアルゴリズム
Author (3):
Material:
Volume: 2007  Issue: 64(MPS-65)  Page: 1-4  Publication year: Jun. 25, 2007 
JST Material Number: Z0031B  ISSN: 0919-6072  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=07A0726293&from=J-GLOBAL&jstjournalNo=Z0031B") }}
JST classification (2):
JST classification
Category name(code) classified by JST.
Basics of graph theory  ,  Artificial intelligence 
Terms in the title (5):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page