Art
J-GLOBAL ID：201002062549034509   Reference number：77A0326536

The complexity of computing steiner minimal trees.

Steiner最小木の計算の複雑さ
Author (3)：
GAREY M R

About GAREY M R

, 
GRAHAM R L

About GRAHAM R L

, 
JOHNSON D S

About JOHNSON D S


Material：
SIAM J Appl Math (Soc Ind Appl Math)  (Journal of the Society for Industrial and Applied Mathematics)

About SIAM J Appl Math (Soc Ind Appl Math)


Volume： 32  Issue： 4  Page： 835-859  Publication year： 1977 
JST Material Number： E0059A  ISSN： 0036-1399  CODEN： SMJMA  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.
計算の複雑さ

About 計算の複雑さ

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=77A0326536&from=J-GLOBAL&jstjournalNo=E0059A") }}
Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
最小木

About 最小木

, 
計算の複雑さ

About 計算の複雑さ


Return to Previous Page

TOP

BOTTOM