Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.
Counting complexity
Euler characteristic
Homomorphisms
Parameterized complexity
Simplicial complexes
Journal
Algorithmica
ISSN: 0178-4617
Titre abrégé: Algorithmica
Pays: United States
ID NLM: 101595914
Informations de publication
Date de publication:
2020
2020
Historique:
received:
23
11
2018
accepted:
08
01
2020
entrez:
18
8
2020
pubmed:
18
8
2020
medline:
18
8
2020
Statut:
ppublish
Résumé
We investigate the problem
Identifiants
pubmed: 32801408
doi: 10.1007/s00453-020-00676-9
pii: 676
pmc: PMC7416760
doi:
Types de publication
Journal Article
Langues
eng
Pagination
2267-2291Informations de copyright
© The Author(s) 2020.