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ženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 83; číslo 6; s. 1829 - 1860
Hlavní autor:	Roth, Marc
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.06.2021 Springer Nature B.V
Témata:	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 přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!