Counting Subgraphs in Degenerate Graphs (Q5889797): Difference between revisions

@@ Property / OpenAlex ID @@
+W4220820401
@@ Property / OpenAlex ID: W4220820401 / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / 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 @@
+Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
+Normal rank
@@ Property / cites work @@
+Q5875738
@@ Property / cites work: Q5875738 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster algorithms for counting subgraphs in sparse graphs
+Normal rank
@@ Property / cites work @@
+Arboricity and Subgraph Listing Algorithms
@@ Property / cites work: Arboricity and Subgraph Listing Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-random graphs
@@ Property / cites work: Quasi-random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms are a good basis for counting small subgraphs
+Normal rank
@@ Property / cites work @@
+Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed parameter clique and dominating set
+Normal rank
@@ Property / cites work @@
+Q3912837
@@ Property / cites work: Q3912837 / 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 @@
+Storing a Sparse Table with             <i>0</i>             (1) Worst Case Access Time
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting small induced subgraphs efficiently
+Normal rank
@@ Property / cites work @@
+Counting and Detecting Small Subgraphs via Equations
+Normal rank
@@ Property / cites work @@
+Q4899293
@@ Property / cites work: Q4899293 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized quasirandom graphs
@@ Property / cites work: Generalized quasirandom graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Smallest-last ordering and clustering and graph coloring algorithms
+Normal rank
@@ Property / cites work @@
+The challenges of unbounded treewidth in parameterised subgraph counting problems
+Normal rank
@@ Property / cites work @@
+Sparsity. Graphs, structures, and algorithms
@@ Property / cites work: Sparsity. Graphs, structures, and algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688439
@@ Property / cites work: Q3688439 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4822945
@@ Property / cites work: Q4822945 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2755077
@@ Property / cites work: Q2755077 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for clique problems
@@ Property / cites work: Efficient algorithms for clique problems / rank @@
+Normal rank
@@ Property / cites work @@
+Multiplying matrices faster than coppersmith-winograd
+Normal rank
@@ Property / cites work @@
+Finding, minimizing, and counting weighted subgraphs
+Normal rank