On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of testing membership in the core of min-cost spanning tree games |
scientific article; zbMATH DE number 1053846
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of testing membership in the core of min-cost spanning tree games |
scientific article; zbMATH DE number 1053846 |
Statements
On the complexity of testing membership in the core of min-cost spanning tree games (English)
0 references
22 April 1998
0 references
cooperative game
0 references
core
0 references
minimal spanning tree
0 references
NP-complete
0 references
0 references
0 references
0.8841114640235901
0 references
0.81949383020401
0 references
