Counting connected subgraphs with maximum-degree-aware sieving
From MaRDI portal
Publication:5091007
DOI10.4230/LIPICS.ISAAC.2018.17MaRDI QIDQ5091007FDOQ5091007
Authors: Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto 
Publication date: 21 July 2022
Recommendations
Cites Work
- Powers of tensors and fast matrix multiplication
- Which problems have strongly exponential complexity?
- Mixing Color Coding-Related Techniques
- Multiplying matrices faster than coppersmith-winograd
- Finding and counting given length cycles
- Counting Paths and Packings in Halves
- Paw-free graphs
- Finding and counting small induced subgraphs efficiently
- Title not available (Why is that?)
- Finding a Minimum Circuit in a Graph
- Faster algorithms for finding and counting subgraphs
- Understanding the Complexity of Induced Subgraph Isomorphisms
- The parameterised complexity of counting connected subgraphs and graph motifs
- Counting subgraphs via homomorphisms
- On the complexity of fixed parameter clique and dominating set
- Balanced families of perfect hash functions and their applications
- Operations with structures
- Some hard families of parameterized counting problems
- Homomorphisms are a good basis for counting small subgraphs
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- If the current clique algorithms are optimal, so is Valiant's parser
- Finding four-node subgraphs in triangle time
- Finding, minimizing, and counting weighted subgraphs
- Counting matchings of size \(k\) is \#W[1]-hard
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Detecting and counting small pattern graphs
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)
