The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721): Difference between revisions

@@ Property / author @@
-Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
-Normal rank
@@ Property / author @@
+Mark R. Jerrum
@@ Property / author: Mark R. Jerrum / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962738766
@@ Property / OpenAlex ID: W2962738766 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1575
@@ Property / arXiv ID: 1308.1575 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Q4427867
@@ Property / cites work: Q4427867 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
+Normal rank
@@ Property / cites work @@
+Understanding the Complexity of Induced Subgraph Isomorphisms
+Normal rank
@@ Property / cites work @@
+Counting Matchings of Size k Is $\sharp$ W[1]-Hard
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+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 @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for finding connected motifs in vertex-colored graphs
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / 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 @@
+On meet matrices on posets
@@ Property / cites work: On meet matrices on posets / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Parameterized counting problems
@@ Property / cites work: Parameterized counting problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the foundations of combinatorial theory I. Theory of M�bius Functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2256721