Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jcss.2010.07.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2018472652
@@ Property / OpenAlex ID: W2018472652 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the Interval Constrained Coloring Problem
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for testing the truth of certain quantified Boolean formulas
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Q4699283
@@ Property / cites work: Q4699283 / rank @@
+Normal rank
@@ Property / cites work @@
+On intervalizing \(k\)-colored graphs for DNA physical mapping
+Normal rank
@@ Property / cites work @@
+Quadratic Kernelization for Convex Recoloring of Trees
+Normal rank
@@ Property / cites work @@
+Two strikes against perfect phylogeny
@@ Property / cites work: Two strikes against perfect phylogeny / rank @@
+Normal rank
@@ Property / cites work @@
+Connected Coloring Completion for General Graphs: Algorithms and Complexity
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / 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 @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of DNA physical mapping
@@ Property / cites work: On the complexity of DNA physical mapping / rank @@
+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 @@
+Deconstructing Intractability: A Case Study for Interval Constrained Coloring
+Normal rank
@@ Property / cites work @@
+Triangulating Vertex-Colored Graphs
@@ Property / cites work: Triangulating Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jcss/FellowsFHV11
@@ Property / DBLP publication ID: journals/jcss/FellowsFHV11 / rank @@
+Normal rank