Efficient computation of the oriented chromatic number of recursively defined digraphs (Q2235732)
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: Efficient computation of the oriented chromatic number of recursively defined digraphs |
scientific article; zbMATH DE number 7412725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computation of the oriented chromatic number of recursively defined digraphs |
scientific article; zbMATH DE number 7412725 |
Statements
Efficient computation of the oriented chromatic number of recursively defined digraphs (English)
0 references
21 October 2021
0 references
oriented graphs
0 references
msp-digraphs
0 references
oriented co-graphs
0 references
oriented coloring
0 references
efficient algorithms
0 references
directed clique-width
0 references
parameterized algorithms
0 references
0 references
0 references
0 references
0.9149102568626404
0 references
0.8070541024208069
0 references
0.7986838817596436
0 references
0.7958784699440002
0 references
0.7888936400413513
0 references
