Finding Approximate and Constrained Motifs in Graphs (Q3011870): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-21458-5_33
+Normal rank
@@ Property / OpenAlex ID @@
+W2179833021
@@ Property / OpenAlex ID: W2179833021 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Kernelization Complexity of Colorful Motifs
+Normal rank
@@ Property / cites work @@
+Some APX-completeness results for cubic graphs
@@ Property / cites work: Some APX-completeness results for cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
+Normal rank
@@ Property / cites work @@
+The Turing way to parameterized complexity
@@ Property / cites work: The Turing way to parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum Motif Problem in Vertex-Colored Graphs
@@ Property / cites work: Maximum Motif Problem in Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Finding and Counting Vertex-Colored Subtrees
@@ Property / cites work: Finding and Counting Vertex-Colored Subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Non deterministic polynomial optimization problems and their approximations
+Normal rank
@@ Property / cites work @@
+Research in Computational Molecular Biology
@@ Property / cites work: Research in Computational Molecular Biology / rank @@
+Normal rank