Finding and counting patterns in sparse graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1796974 (Why is no real title available?)
- scientific article; zbMATH DE number 7561323 (Why is no real title available?)
- Complexity of counting subgraphs: only the boundedness of the vertex-cover number counts
- Counting and detecting small subgraphs via equations
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- Counting small induced subgraphs with hereditary properties
- Exact and approximate pattern counting in degenerate graphs: new algorithms, hardness results, and complexity dichotomies
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster algorithms for finding and counting subgraphs
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding four-node subgraphs in triangle time
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Homomorphisms are a good basis for counting small subgraphs
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Obstructions for tree-depth
- On the complexity of fixed parameter clique and dominating set
This page was built for publication: Finding and counting patterns in sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859749)
