Parameterized Counting of Partially Injective Homomorphisms

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 of graph homomorphisms, subgraph counting and, more generally, counting of answers to equi-join queri...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 6; pp. 1829 - 1860
Main Author:	Roth, Marc
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.06.2021 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Classification Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Graphs Homomorphisms Inequalities Mathematics of Computing Parameterization Parameters Theorems Theory of Computation Matroid lattices Graph homomorphisms Parameterized complexity theory Counting problems Möbius function
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!