The complexity of colouring by locally semicomplete digraphs (Q709314)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5801211
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of colouring by locally semicomplete digraphs |
scientific article; zbMATH DE number 5801211 |
Statements
The complexity of colouring by locally semicomplete digraphs (English)
0 references
18 October 2010
0 references
digraph homomorphism
0 references
complexity
0 references
polynomial algorithm
0 references
NP-completeness
0 references
locally semicomplete digraphs
0 references
0 references
0.857571542263031
0 references
0.8252081274986267
0 references
0.8199360966682434
0 references
0.8067823052406311
0 references
