Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-55911-7_16
+Normal rank
@@ Property / OpenAlex ID @@
+W2602050303
@@ Property / OpenAlex ID: W2602050303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5567717
@@ Property / cites work: Q5567717 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity issues in vertex-colored graph pattern matching
+Normal rank
@@ Property / cites work @@
+Graph Motif Problems Parameterized by Dual
@@ Property / cites work: Graph Motif Problems Parameterized by Dual / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank
@@ Property / cites work @@
+Speedy Colorful Subtrees
@@ Property / cites work: Speedy Colorful Subtrees / rank @@
+Normal rank