The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (Q2883612): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 08:55, 5 March 2024
scientific article
| 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 |
Statements
The computational complexity of the Edge-Perfect Graph and the Totally Balanced Packing Game recognition problems (English)
0 references
13 May 2012
0 references
graph theory
0 references
totally balanced packing games
0 references
computational complexity
0 references
