On the absolute and relative oriented clique problems' time complexity (Q6885220)
From MaRDI portal
!
WARNING
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 8135852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the absolute and relative oriented clique problems' time complexity |
scientific article; zbMATH DE number 8135852 |
Statements
On the absolute and relative oriented clique problems' time complexity (English)
0 references
11 December 2025
0 references
oriented chromatic number
0 references
oriented absolute clique
0 references
oriented relative clique
0 references
NP-completeness
0 references
non-appromability
0 references
parameterized complexity
0 references
