Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness

We study the problem # I N D S U B ( Φ ) of counting all induced subgraphs of size k in a graph G that satisfy the property Φ . It is shown that, given any graph property Φ that distinguishes independent sets from bicliques, # I N D S U B ( Φ ) is hard for the class # W [ 1 ] , i.e., the parameteriz...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 84; číslo 2; s. 379 - 404
Hlavní autori:	Dörfler, Julian, Roth, Marc, Schmitt, Johannes, Wellnitz, Philip
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2022 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Hardness Mathematics of Computing Theory of Computation Counting complexity Edge-transitive graphs Graph homomorphisms Induced subgraphs Parameterized complexity
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!