Parameterized Counting of Partially Injective Homomorphisms
Work
Year: 2021
Type: article
Abstract: We study the parameterized complexity of the problem of counting graph homomorphisms with given partial injectivity constraints, i.e., inequalities between pairs of vertices, which subsumes counting ... more
Source: Algorithmica
Author Marc Roth
Institution Max Planck Institute for Informatics
Cites: 64
Cited by: 2
Related to: 10
FWCI: 0.259
Citation percentile (by year/subfield): 51.97
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
APC paid (est): $2,890