Computing a 3-role assignment is polynomial-time solvable on complementary prisms (Q6854533)
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 8163020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a 3-role assignment is polynomial-time solvable on complementary prisms |
scientific article; zbMATH DE number 8163020 |
Statements
Computing a 3-role assignment is polynomial-time solvable on complementary prisms (English)
0 references
24 February 2026
0 references
role assignment
0 references
complementary prism
0 references
polynomial time
0 references
