Art
J-GLOBAL ID:200902015684031928   Reference number:83A0166062

An approximation algorithm for the maximum independent set problem on planar graphs.

平面グラフの最大の独立な集合問題の近似アルゴリズム
Author (3):
Material:
Volume: 11  Issue:Page: 663-675  Publication year: Nov. 1982 
JST Material Number: D0944A  ISSN: 0097-5397  CODEN: SMJCAT  Document type: Article
Article type: 原著論文  Country of issue: United States (USA)  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=83A0166062&from=J-GLOBAL&jstjournalNo=D0944A") }}
JST classification (1):
JST classification
Category name(code) classified by JST.
Theory of computation 
Terms in the title (4):
Terms in the title
Keywords automatically extracted from the title.

Return to Previous Page