The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (Q2883612)
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: The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems |
scientific article; zbMATH DE number 6033968
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems |
scientific article; zbMATH DE number 6033968 |
Statements
13 May 2012
0 references
graph theory
0 references
totally balanced packing games
0 references
computational complexity
0 references
0.9196193
0 references
0.88413405
0 references
0.8782804
0 references
0.8763253
0 references
0.8658482
0 references
0.86524606
0 references
0 references
0 references
0.8633974
0 references
The computational complexity of the edge-perfect graph and the totally balanced packing game recognition problems (English)
0 references
