scientific article; zbMATH DE number 7561670
From MaRDI portal
Publication:5092385
DOI10.4230/LIPIcs.MFCS.2019.26MaRDI QIDQ5092385
Johannes Schmitt, Philip Wellnitz, Julian Dörfler, Marc Roth
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.10479
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
induced subgraphsgraph homomorphismsparameterized complexitycounting complexityedge-transitive graphs
Related Items (1)
Cites Work
- The complexity of computing the permanent
- The complexity of counting homomorphisms seen from the other side
- Strong computational lower bounds via parameterized complexity
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- A topological approach to evasiveness
- On recognizing graph properties from adjacency matrices
- The parameterised complexity of counting even and odd induced subgraphs
- The parameterised complexity of counting connected subgraphs and graph motifs
- Parametrized complexity theory.
- Tight lower bounds for certain parameterized NP-hard problems
- Parameterized counting problems
- Some Hard Families of Parameterized Counting Problems
- Evasiveness of Graph Properties and Topological Fixed-Point Theorems
- PP is as Hard as the Polynomial-Time Hierarchy
- The Parameterized Complexity of Counting Problems
- Homomorphisms are a good basis for counting small subgraphs
- Paths, Trees, and Flowers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
