Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

DOI10.1137/1.9781611975994.133MaRDI QIDQ5146921zbMATH OpenOpenAlexFDO

Authors Marc Roth, Philip Wellnitz

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.03850

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(7)

• Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2
• The HOM Problem is EXPTIME-Complete
• Counting subgraphs in somewhere dense graphs
• Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
• The complexity of homomorphism reconstructibility
• On counting (quantum-)graph homomorphisms in finite fields of prime order
• A dichotomy theorem for linear time homomorphism orbit counting in bounded degeneracy graphs

This page was built for publication: Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146921)