Count on CFI graphs for #P-hardness.

Radu Curticapean

Published in: SODA (2024)

Keyphrases

graph theoretic
graph matching
graph representation
computational complexity
series parallel
sliding window
learning theory
graph theory
random graphs
graph mining
bayesian networks
phase transition
np hard
constraint satisfaction problems
graph construction
np hardness
structured objects