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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 83; číslo 6; s. 1829 - 1860
Hlavný autor:	Roth, Marc
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2021 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!