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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 83; H. 6; S. 1829 - 1860
1. Verfasser:	Roth, Marc
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2021 Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!