Pages that link to "Item:Q832520"
From MaRDI portal
The following pages link to Counting induced subgraphs: an algebraic approach to \(\#\)W[1]-hardness (Q832520):
Displaying 9 items.
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- The parameterised complexity of counting even and odd induced subgraphs (Q1714949) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Parameterised and fine-grained subgraph counting, modulo 2 (Q6130316) (← links)
- Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)