scientific article; zbMATH DE number 7561323
From MaRDI portal
Publication:5090953
DOI10.4230/LIPIcs.FSTTCS.2018.18MaRDI QIDQ5090953
Karteek Sreenivasaiah, Markus Bläser, Balagopal Komarath
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1809.08858
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Related Items (3)
Streaming deletion problems Parameterized by vertex cover ⋮ Monotone arithmetic complexity of graph homomorphism polynomials ⋮ Rare siblings speed-up deterministic detection and counting of small pattern graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Faster algorithms for finding and counting subgraphs
- On the complexity of fixed parameter clique and dominating set
- Induced subgraph isomorphism: are some patterns substantially easier than others?
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
- A Linear Recognition Algorithm for Cographs
- Finding a Minimum Circuit in a Graph
- LIMITS and Applications of Group Algebras for Parameterized Problems
- Homomorphisms are a good basis for counting small subgraphs
- Finding Four-Node Subgraphs in Triangle Time
- Detecting and Counting Small Pattern Graphs
This page was built for publication:
