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

Marco Bressan Marc Roth

Published in: FOCS (2022)

Keyphrases

exact and approximate
computational complexity
worst case
learning algorithm
pattern matching
data structure
lower bound
query evaluation
graph matching
string matching
data sets
object recognition
np hard
combinatorial optimization