Component order connectivity in directed graphs (Q2165039): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3042980074
@@ Property / OpenAlex ID: W3042980074 / rank @@
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Directed Graphs
@@ Property / cites work: Classes of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Almost Optimal Cover-Free Families
@@ Property / cites work: Almost Optimal Cover-Free Families / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism within $P^ *  $
@@ Property / cites work: Nondeterminism within $P^ * $ / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+A fixed-parameter algorithm for the directed feedback vertex set problem
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity of vertex integrity and component order connectivity
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for generalizations of directed feedback vertex set
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4634403
@@ Property / cites work: Q4634403 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into small pieces with applications to path transversal
+Normal rank
@@ Property / cites work @@
+Q5089249
@@ Property / cites work: Q5089249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4694754
@@ Property / cites work: Q4694754 / rank @@
+Normal rank