The complexity of pattern counting in directed graphs, parameterised by the outdegree
From MaRDI portal
Cites work
- Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space
- Arboricity and Subgraph Listing Algorithms
- Can you beat treewidth?
- Counting Answers to Existential Questions
- Counting Homomorphic Cycles in Degenerate Graphs
- Counting matchings of size \(k\) is \#W[1]-hard
- Counting Subgraphs in Degenerate Graphs
- Exponential Time Complexity of the Permanent and the Tutte Polynomial
- Extensor-coding
- Faster algorithms for counting subgraphs in sparse graphs
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 1979521 (Why is no real title available?)
- scientific article; zbMATH DE number 6116733 (Why is no real title available?)
- scientific article; zbMATH DE number 7650108 (Why is no real title available?)
- scientific article; zbMATH DE number 7650386 (Why is no real title available?)
- Large networks and graph limits
- On the complexity of k-SAT
- Parametrized complexity theory.
- Rooted grid minors
- Statistical mechanics of complex networks
- 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 parameterised complexity of counting connected subgraphs and graph motifs
- The Parameterized Complexity of Counting Problems
- Tight lower bounds for certain parameterized NP-hard problems
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries
- Understanding the Complexity of Induced Subgraph Isomorphisms
- When is approximate counting for conjunctive queries tractable?
Cited in
(2)
This page was built for publication: The complexity of pattern counting in directed graphs, parameterised by the outdegree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499249)
