Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies.

Marco Bressan Marc Roth

Published in: FOCS (2021)

Keyphrases

exact and approximate
computational complexity
worst case
optimization problems
machine learning algorithms
string matching
np hard
pattern matching
learning algorithm
genetic algorithm
high dimensional
machine learning
data sets
combinatorial optimization
query evaluation
branch and bound
graph mining
databases