A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights

Govorov, A, Cai, JY and Dyer, M orcid.org/0000-0002-2018-0374 (2020) A Dichotomy for Bounded Degree Graph Homomorphisms with Nonnegative Weights. In: LIPIcs : Leibniz International Proceedings in Informatics. 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), 08-11 Jul 2020, Online. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 66:1-66:18. ISBN 9783959771382

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © Artem Govorov, Jin-Yi Cai, and Martin Dyer. This is an open access article under the terms of the Creative Commons Attribution 3.0 Unported (CC BY 3.0) (https://creativecommons.org/licenses/by/3.0/)
Keywords: Graph homomorphism; Complexity dichotomy; Counting problems
Dates:
  • Accepted: 8 July 2020
  • Published (online): 8 July 2020
  • Published: 8 July 2020
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/S016562/1
Depositing User: Symplectic Publications
Date Deposited: 18 Sep 2020 10:23
Last Modified: 02 Nov 2021 09:35
Status: Published
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
Identification Number: https://doi.org/10.4230/LIPIcs.ICALP.2020.66

Export

Statistics