Faster algorithms for finding and counting subgraphs (Q439930): Difference between revisions

@@ Property / Wikidata QID @@
+Q60488486
@@ Property / Wikidata QID: Q60488486 / rank @@
+Normal rank
@@ 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.1016/j.jcss.2011.10.001
+Normal rank
@@ Property / OpenAlex ID @@
+W2089369802
@@ Property / OpenAlex ID: W2089369802 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced families of perfect hash functions and their applications
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Subgraphs via Homomorphisms
@@ Property / cites work: Counting Subgraphs via Homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Paths and Packings in Halves
@@ Property / cites work: Counting Paths and Packings in Halves / rank @@
+Normal rank
@@ Property / cites work @@
+Narrow sieves for parameterized paths and packings
+Normal rank
@@ Property / cites work @@
+Trimmed Moebius inversion and graphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Q3424888
@@ Property / cites work: Q3424888 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934608
@@ Property / cites work: Q2934608 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem
+Normal rank
@@ Property / cites work @@
+Counting \(H-\)colorings of partial \(k-\)trees
@@ Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank @@
+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 @@
+Computational aspects of the Mobius transformation of graphs
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Divide-and-Color
@@ Property / cites work: Divide-and-Color / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Algebraic Algorithms for Path and Packing Problems
+Normal rank
@@ Property / cites work @@
+Limits and Applications of Group Algebras for Parameterized Problems
+Normal rank
@@ Property / cites work @@
+Finding, minimizing, and counting weighted subgraphs
+Normal rank
@@ Property / cites work @@
+Finding paths of length \(k\) in \(O^{*}(2^k)\) time
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:439930