scientific article; zbMATH DE number 7561323
From MaRDI portal
Publication:5090953
DOI10.4230/LIPICS.FSTTCS.2018.18MaRDI QIDQ5090953FDOQ5090953
Authors: Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1809.08858
Title of this publication is not available (Why is that?)
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Title not available (Why is that?)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Title not available (Why is that?)
- A Linear Recognition Algorithm for Cographs
- Finding a Minimum Circuit in a Graph
- Faster algorithms for finding and counting subgraphs
- On the complexity of fixed parameter clique and dominating set
- Homomorphisms are a good basis for counting small subgraphs
- LIMITS and Applications of Group Algebras for Parameterized Problems
- Finding four-node subgraphs in triangle time
- Dichotomy theorems for homomorphism polynomials of graph classes
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Detecting and counting small pattern graphs
Cited In (5)
- Graph-polynomials
- Rare siblings speed-up deterministic detection and counting of small pattern graphs
- Monotone arithmetic complexity of graph homomorphism polynomials
- Fredman's trick meets dominance product: fine-grained complexity of unweighted APSP, 3SUM counting, and more
- Streaming deletion problems Parameterized by vertex cover
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090953)
