Detecting and counting small pattern graphs
From MaRDI portal
Recommendations
- Detecting and Counting Small Pattern Graphs
- Counting and detecting small subgraphs via equations
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Counting and detecting small subgraphs via equations and matrix multiplication
- Induced subgraph isomorphism: are some patterns substantially easier than others?
Cites work
- A Linear Recognition Algorithm for Cographs
- A probabilistic remark on algebraic program testing
- Counting and detecting small subgraphs via equations
- Determinant sums for undirected Hamiltonicity
- Experimental and Efficient Algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Faster algorithms for finding and counting subgraphs
- Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
- Finding and counting small induced subgraphs efficiently
- Finding and listing induced paths and cycles
- Finding four-node subgraphs in triangle time
- Finding, minimizing, and counting weighted subgraphs
- scientific article; zbMATH DE number 5764853 (Why is no real title available?)
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Limits and Applications of Group Algebras for Parameterized Problems
- Multiplying matrices faster than coppersmith-winograd
- On the complexity of fixed parameter clique and dominating set
- Paw-free graphs
- Systems of distinct representatives and linear algebra
Cited in
(30)- Are unique subgraphs not easier to find?
- Efficient algorithms for subgraph listing
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Counting and detecting small subgraphs via equations
- Detecting and Counting Small Pattern Graphs
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- A fast deterministic detection of small pattern graphs in graphs without large cliques
- Indexing with well-founded total order for faster subgraph isomorphism detection
- Unique small subgraphs are not easier to find
- Planar subgraph isomorphism revisited
- On the first-order complexity of induced subgraph isomorphism
- Faster algorithms for finding and counting subgraphs
- Recognizing small subgraphs
- Tensor network complexity of multilinear maps
- Graph pattern polynomials
- Counting connected subgraphs with maximum-degree-aware sieving
- Detecting and counting small patterns in planar graphs in subexponential parameterized time
- Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
- Engineering a delegatable and error-tolerant algorithm for counting small subgraphs
- Counting and detecting small subgraphs via equations and matrix multiplication
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Monotone arithmetic complexity of graph homomorphism polynomials
- Finding and counting small induced subgraphs efficiently
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Finding and counting small tournaments in large tournaments
- Multiplication of 0-1 matrices via clustering
- Subgraph enumeration in optimal I/O complexity
- Induced subgraph isomorphism: are some patterns substantially easier than others?
This page was built for publication: Detecting and counting small pattern graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502097)
