Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and efficiency on \(t\)-admissibility for graph operations |
scientific article |
Statements
Hardness and efficiency on \(t\)-admissibility for graph operations (English)
0 references
30 September 2021
0 references
\(t\)-admissibility
0 references
computational complexity
0 references
complementary prism graphs
0 references
Cartesian product
0 references
0 references
0 references
