Pages that link to "Item:Q4977973"

The following pages link to Homomorphisms are a good basis for counting small subgraphs (Q4977973):

Displaying 41 items.

• Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
• Compactors for parameterized counting problems (Q826317) (← links)
• Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520) (← links)
• On the problem of finding small subdivision and homomorphism bases for classes of countable graphs (Q1061752) (← links)
• Computing the number of induced copies of a fixed graph in a bounded degree graph (Q1741847) (← links)
• Parameterized counting of partially injective homomorphisms (Q2032353) (← links)
• Faster algorithms for counting subgraphs in sparse graphs (Q2041986) (← links)
• Local WL invariance and hidden shades of regularity (Q2235273) (← links)
• A fixed-parameter perspective on \#BIS (Q2272593) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Counting problems in parameterized complexity (Q5009461) (← links)
• (Q5009487) (← links)
• Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
• Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• (Q5090377) (← links)
• (Q5090953) (← links)
• (Q5091007) (← links)
• Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
• Counting Answers to Existential Questions (Q5091275) (← links)
• (Q5092385) (← links)
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices (Q5111752) (← links)
• (Q5111872) (← links)
• Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
• The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Faster Subgraph Counting in Sparse Graphs (Q5875538) (← links)
• Counting Subgraphs in Degenerate Graphs (Q5889797) (← links)
• Counting subgraphs via homomorphisms (Q5891745) (← links)
• Counting Subgraphs via Homomorphisms (Q5902149) (← links)
• On Weisfeiler-Leman invariance: subgraph counts and related graph properties (Q5918849) (← links)
• Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
• Monotone arithmetic complexity of graph homomorphism polynomials (Q6077890) (← links)
• Parameterised counting in logspace (Q6093373) (← links)
• Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
• Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
• Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)
• Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
• Logical equivalences, homomorphism indistinguishability, and forbidden minors (Q6647759) (← links)
• Finding and counting small tournaments in large tournaments (Q6652454) (← links)