On the computational complexity of vertex integrity and component order connectivity (Q727981): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:21, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of vertex integrity and component order connectivity |
scientific article |
Statements
On the computational complexity of vertex integrity and component order connectivity (English)
0 references
21 December 2016
0 references
graph vulnerability
0 references
parameterized complexity
0 references
complexity
0 references
graph algorithms
0 references
preprocessing
0 references
