Spanning trees and the complexity of flood-filling games (Q489766)
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: Spanning trees and the complexity of flood-filling games |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Spanning trees and the complexity of flood-filling games |
scientific article |
Statements
Spanning trees and the complexity of flood-filling games (English)
0 references
21 January 2015
0 references
computational complexity
0 references
graph colouring
0 references
games on graphs
0 references
0.9055255055427552
0 references
0.8766334652900696
0 references
0.8731927275657654
0 references
0.8611992001533508
0 references
0.8516324162483215
0 references
