On the computational complexity of vertex integrity and component order connectivity (Q727981): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2942636
aliases / en / 0aliases / en / 0
 
On the Computational Complexity of Vertex Integrity and Component Order Connectivity
description / endescription / en
 
scientific article; zbMATH DE number 6480921
Property / title
 
On the Computational Complexity of Vertex Integrity and Component Order Connectivity (English)
Property / title: On the Computational Complexity of Vertex Integrity and Component Order Connectivity (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1352.68103 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-13075-0_23 / rank
 
Normal rank
Property / author
 
Property / author: Pål Grønås Drange / rank
 
Normal rank
Property / author
 
Property / author: Markus Sortland Dregi / rank
 
Normal rank
Property / author
 
Property / author: Pim van 't Hof / rank
 
Normal rank
Property / published in
 
Property / published in: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
11 September 2015
Timestamp+2015-09-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 September 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6480921 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2626942967 / rank
 
Normal rank

Revision as of 14:22, 29 April 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
  • On the Computational Complexity of Vertex Integrity and Component Order Connectivity

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
0 references
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references