Art
J-GLOBAL ID:201202292460333413   Reference number:12A1718403

Computation of the Shapley value of minimum cost spanning tree games: #P-hardness and polynomial cases

最小コストスパンニング木ゲームのShapley値の計算:#P-困難性及び多項式事例
Author (1):
Material:
Volume: 29  Issue:Page: 385-400  Publication year: Oct. 2012 
JST Material Number: L5671A  ISSN: 0916-7005  Document type: Article
Article type: 原著論文  Country of issue: Germany, Federal Republic of (DEU)  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.

JST classification (2):
JST classification
Category name(code) classified by JST.
Basics of graph theory  ,  Game thoery 
Reference (24):
more...

Return to Previous Page