Computational complexity of a solution for directed graph cooperative games (Q384201): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s40305-013-0025-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2156084709 / rank | |||
Normal rank |
Revision as of 21:15, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computational complexity of a solution for directed graph cooperative games |
scientific article |
Statements
Computational complexity of a solution for directed graph cooperative games (English)
0 references
27 November 2013
0 references
\(\#P\)-complete
0 references
digraph game
0 references
average covering tree value
0 references
coalition
0 references
communication structure
0 references
linear extension
0 references