Counting Small Induced Subgraphs Satisfying Monotone Properties
From MaRDI portal
Recommendations
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- The parameterised complexity of counting connected subgraphs and graph motifs
Cites work
- A complete dichotomy for complex-valued \(\textsc{Holant}^c\)
- A dichotomy for real weighted Holant problems
- A fixed-parameter perspective on \#BIS
- A topological approach to evasiveness
- A trichotomy in the complexity of counting answers to conjunctive queries
- An Algorithm for Subgraph Isomorphism
- Approximating pairwise correlations in the Ising model
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
- Can you beat treewidth?
- Counting \(H-\)colorings of partial \(k-\)trees
- Counting Answers to Existential Questions
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- Dichotomy for real Holant\(^{\mathrm c}\) problems
- Dimer problem in statistical mechanics-an exact result
- Evasiveness of graph properties and topological fixed-point theorems
- From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
- Girth and treewidth
- Holographic Algorithms
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Holographic algorithms: from art to science
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 1182908 (Why is no real title available?)
- scientific article; zbMATH DE number 7075922 (Why is no real title available?)
- Large networks and graph limits
- Lower bound of the Hadwiger number of graphs by their average degree
- Lower bounds based on the exponential time hypothesis
- On a property of the class of n-colorable graphs
- On Hermite-Birkhoff interpolation
- On the complexity of k-SAT
- Parameterized algorithms
- Parameterized complexity of finding subgraphs with hereditary properties.
- Paths, Trees, and Flowers
- PP is as Hard as the Polynomial-Time Hierarchy
- Ramsey's theorem - a new lower bound
- Some hard families of parameterized counting problems
- Strong computational lower bounds via parameterized complexity
- Structural tractability of counting of solutions to conjunctive queries
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- The complexity of computing the permanent
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The complexity of counting homomorphisms seen from the other side
- The Complexity of Enumeration and Reliability Problems
- The complexity of theorem-proving procedures
- The extremal function for complete minors
- The parameterised complexity of counting connected subgraphs and graph motifs
- The parameterised complexity of counting even and odd induced subgraphs
- The Parameterized Complexity of Counting Problems
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- The strong perfect graph theorem
- Tight lower bounds for certain parameterized NP-hard problems
- Transactions on Computational Systems Biology III
- When is the evaluation of conjunctive queries tractable?
Cited in
(6)- Finding and counting small induced subgraphs efficiently
- Counting Small Induced Subgraphs with Hereditary Properties
- Parameterized Counting and Cayley Graph Expanders
- Counting subgraphs in somewhere dense graphs
- Counting small induced subgraphs: scorpions are easy but not trivial
- Can you link up with treewidth?
This page was built for publication: Counting Small Induced Subgraphs Satisfying Monotone Properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5071087)
