scientific article; zbMATH DE number 7561371
From MaRDI portal
Publication:5091007
DOI10.4230/LIPIcs.ISAAC.2018.17MaRDI QIDQ5091007
Mikko Koivisto, Petteri Kaski, Thore Husfeldt, Andreas Björklund
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Finding and counting small induced subgraphs efficiently
- Faster algorithms for finding and counting subgraphs
- Finding and counting given length cycles
- On the complexity of fixed parameter clique and dominating set
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- Paw-free graphs
- Which problems have strongly exponential complexity?
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- The parameterised complexity of counting connected subgraphs and graph motifs
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
- Some Hard Families of Parameterized Counting Problems
- Finding, Minimizing, and Counting Weighted Subgraphs
- Balanced families of perfect hash functions and their applications
- Powers of tensors and fast matrix multiplication
- Mixing Color Coding-Related Techniques
- Understanding the Complexity of Induced Subgraph Isomorphisms
- Counting Paths and Packings in Halves
- Finding a Minimum Circuit in a Graph
- Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
- Homomorphisms are a good basis for counting small subgraphs
- Counting Matchings of Size k Is $\sharp$ W[1-Hard]
- Finding Four-Node Subgraphs in Triangle Time
- Multiplying matrices faster than coppersmith-winograd
- Detecting and Counting Small Pattern Graphs
- Operations with structures
- Counting Subgraphs via Homomorphisms
