The NP-completeness of the road coloring problem (Q1944896)
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 NP-completeness of the road coloring problem |
scientific article; zbMATH DE number 6149183
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The NP-completeness of the road coloring problem |
scientific article; zbMATH DE number 6149183 |
Statements
The NP-completeness of the road coloring problem (English)
0 references
28 March 2013
0 references
computational complexity
0 references
synchronization
0 references
road coloring problem
0 references
