Pages that link to "Item:Q2256721"
From MaRDI portal
The following pages link to The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721):
Displaying 22 items.
- Parameterized complexity of connected even/odd subgraph problems (Q395000) (← links)
- 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)
- The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
- Parameterized complexity of finding connected induced subgraphs (Q897959) (← links)
- The parameterised complexity of counting even and odd induced subgraphs (Q1714949) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties on hereditary graph classes (Q2140500) (← links)
- Parameterized counting matching and packing: a family of hard problems that admit FPTRAS (Q2636502) (← links)
- Some hard families of parameterized counting problems (Q2832302) (← links)
- On Counting Parameterized Matching and Packing (Q4632178) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- (Q5009487) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- (Q5091007) (← links)
- (Q5092385) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
- On the perception of small sub-graphs (Q6560150) (← links)
- Counting subgraphs in somewhere dense graphs (Q6621747) (← links)
