Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.

Marc Roth Johannes Schmitt

Published in: Algorithmica (2020)

Keyphrases

topological information
topological properties
phase transition
np hard
np complete
information theoretic
graph mining
persistent homology
data sets
maximum clique
learning theory
connected components
worst case
special case
lower bound
computational complexity
optimal solution
similarity measure
neural network