Graph pattern polynomials
From MaRDI portal
Publication:5090953
Recommendations
- Detecting and Counting Small Pattern Graphs
- Detecting and counting small pattern graphs
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Faster algorithms for finding and counting subgraphs
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Detecting and counting small pattern graphs
- Dichotomy theorems for homomorphism polynomials of graph classes
- Faster algorithms for finding and counting subgraphs
- Finding a Minimum Circuit in a Graph
- Finding four-node subgraphs in triangle time
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Homomorphisms are a good basis for counting small subgraphs
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- LIMITS and applications of group algebras for parameterized problems
- On the complexity of fixed parameter clique and dominating set
Cited in
(5)- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Graph-polynomials
- Streaming deletion problems Parameterized by vertex cover
- Monotone arithmetic complexity of graph homomorphism polynomials
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
This page was built for publication: Graph pattern polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090953)
