Counting connected subgraphs with maximum-degree-aware sieving
From MaRDI portal
(Redirected from Publication:5091007)
Recommendations
Cites work
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Balanced families of perfect hash functions and their applications
- Counting matchings of size \(k\) is \#W[1]-hard
- Counting Paths and Packings in Halves
- Counting subgraphs via homomorphisms
- Detecting and counting small pattern graphs
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Faster algorithms for finding and counting subgraphs
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Finding four-node subgraphs in triangle time
- Finding, minimizing, and counting weighted subgraphs
- Homomorphisms are a good basis for counting small subgraphs
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- If the current clique algorithms are optimal, so is Valiant's parser
- Mixing Color Coding-Related Techniques
- Multiplying matrices faster than coppersmith-winograd
- On the complexity of fixed parameter clique and dominating set
- Operations with structures
- Paw-free graphs
- Powers of tensors and fast matrix multiplication
- Some hard families of parameterized counting problems
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- The parameterised complexity of counting connected subgraphs and graph motifs
- Understanding the Complexity of Induced Subgraph Isomorphisms
- Which problems have strongly exponential complexity?
This page was built for publication: Counting connected subgraphs with maximum-degree-aware sieving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091007)
