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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On the Computational Complexity of Vertex Integrity and Component Order Connectivity
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6480921
@@ Property / title @@
+On the Computational Complexity of Vertex Integrity and Component Order Connectivity (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68103
@@ Property / zbMATH Open document ID: 1352.68103 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-13075-0_23
@@ Property / DOI: 10.1007/978-3-319-13075-0_23 / rank @@
+Normal rank
@@ Property / author @@
+Pål Grønås Drange
@@ Property / author: Pål Grønås Drange / rank @@
+Normal rank
@@ Property / author @@
+Markus Sortland Dregi
@@ Property / author: Markus Sortland Dregi / rank @@
+Normal rank
@@ Property / author @@
+Pim van 't Hof
@@ Property / author: Pim van 't Hof / rank @@
+Normal rank
@@ Property / published in @@
+Algorithms and Computation
@@ Property / published in: Algorithms and Computation / rank @@
+Normal rank
@@ Property / publication date @@
+September 2015Timestamp +2015-09-11T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-09-11T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 11 September 2015 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6480921
@@ Property / zbMATH DE Number: 6480921 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2460257212
@@ Property / OpenAlex ID: W2460257212 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2626942967
@@ Property / OpenAlex ID: W2626942967 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6331
@@ Property / arXiv ID: 1403.6331 / rank @@
+Normal rank
@@ Property / cites work @@
+A survey of integrity
@@ Property / cites work: A survey of integrity / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+The k-Separator Problem
@@ Property / cites work: The k-Separator Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Equitable colorings of bounded treewidth graphs
@@ Property / cites work: Equitable colorings of bounded treewidth graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Q3775581
@@ Property / cites work: Q3775581 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Q3032280
@@ Property / cites work: Q3032280 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Counting clique trees and computing perfect elimination schemes in parallel
+Normal rank
@@ Property / cites work @@
+Measuring the vulnerability for classes of intersection graphs
+Normal rank
@@ Property / cites work @@
+Vulnerability parameters of split graphs
@@ Property / cites work: Vulnerability parameters of split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320674
@@ Property / cites work: Q4320674 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3428636
@@ Property / cites work: Q3428636 / rank @@
+Normal rank
@@ Property / cites work @@
+The toughness of split graphs
@@ Property / cites work: The toughness of split graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Comparability graphs and intersection graphs
@@ Property / cites work: Comparability graphs and intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The clique-separator graph for chordal graphs
@@ Property / cites work: The clique-separator graph for chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q5365079
@@ Property / cites work: Q5365079 / rank @@
+Normal rank

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	On the Computational Complexity of Vertex Integrity and Component Order Connectivity