Minimum leaf out-branching and related problems (Q1035689): Difference between revisions

@@ Property / cites work @@
+Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum spanning strong subdigraph problem is fixed parameter tractable
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized algorithmics for linear arrangement problems
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The linear arrangement problem parameterized above guaranteed value
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of minimum profile problems
+Normal rank
@@ Property / cites work @@
+Q3549635
@@ Property / cites work: Q3549635 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3369936
@@ Property / cites work: Q3369936 / rank @@
+Normal rank