On the computational complexity of vertex integrity and component order connectivity (Q727981): Difference between revisions
From MaRDI portal
Latest revision as of 04:25, 13 July 2024
scientific article; zbMATH DE number 6480921
- On the Computational Complexity of Vertex Integrity and Component Order Connectivity
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of vertex integrity and component order connectivity |
scientific article; zbMATH DE number 6480921 |
|
Statements
On the computational complexity of vertex integrity and component order connectivity (English)
0 references
On the Computational Complexity of Vertex Integrity and Component Order Connectivity (English)
0 references
21 December 2016
0 references
11 September 2015
0 references
graph vulnerability
0 references
parameterized complexity
0 references
complexity
0 references
graph algorithms
0 references
preprocessing
0 references
0 references
