\(k\)-distinct in- and out-branchings in digraphs (Q1747490): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2018.01.003
@@ Property / DOI: 10.1016/j.jcss.2018.01.003 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.03607
@@ Property / arXiv ID: 1612.03607 / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Directed Trees with Many Leaves
@@ Property / cites work: Spanning Directed Trees with Many Leaves / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint in- and out-branchings in tournaments and related path problems
+Normal rank
@@ Property / cites work @@
+Q4539516
@@ Property / cites work: Q4539516 / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi‐transitive digraphs
@@ Property / cites work: Quasi‐transitive digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Arc-Disjoint In- and Out-Branchings With the Same Root in Locally Semicomplete Digraphs
+Normal rank
@@ Property / cites work @@
+Parameterized algorithms for non-separating trees and branchings in digraphs
+Normal rank
@@ Property / cites work @@
+Arc-disjoint paths and trees in 2-regular digraphs
+Normal rank
@@ Property / cites work @@
+Small degree out‐branchings
@@ Property / cites work: Small degree out‐branchings / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum spanning strong subdigraph problem is fixed parameter tractable
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+FPT algorithms and kernels for the directed \(k\)-leaf problem
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum branchings
@@ Property / cites work: Optimum branchings / rank @@
+Normal rank
@@ Property / cites work @@
+Tournament pathwidth and topological containment
@@ Property / cites work: Tournament pathwidth and topological containment / rank @@
+Normal rank
@@ Property / cites work @@
+The Directed Grid Theorem
@@ Property / cites work: The Directed Grid Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Tournament minors
@@ Property / cites work: Tournament minors / rank @@
+Normal rank
@@ Property / cites work @@
+A new algorithm for finding trees with many leaves
+Normal rank
@@ Property / Wikidata QID @@
+Q130128701
@@ Property / Wikidata QID: Q130128701 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2018.01.003
@@ Property / DOI: 10.1016/J.JCSS.2018.01.003 / rank @@
+Normal rank