On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6672923
@@ Property / zbMATH DE Number: 6672923 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+graph cut
@@ Property / zbMATH Keywords: graph cut / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(k\)-restricted edge-connectivity
@@ Property / zbMATH Keywords: \(k\)-restricted edge-connectivity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+good edge separation
@@ Property / zbMATH Keywords: good edge separation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+parameterized complexity
@@ Property / zbMATH Keywords: parameterized complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+FPT-algorithm
@@ Property / zbMATH Keywords: FPT-algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial kernel
@@ Property / zbMATH Keywords: polynomial kernel / rank @@
+Normal rank

Revision as of 01:29, 1 July 2023