The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes (Q5410637): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1631436345 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1209.5267 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:07, 20 April 2024
scientific article; zbMATH DE number 6286264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes |
scientific article; zbMATH DE number 6286264 |
Statements
The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes (English)
0 references
16 April 2014
0 references
