Graphs can be succinctly indexed for pattern matching in $ O(|E|^2 + |V|^{5 / 2}) $ time.

Nicola Cotumaccio

Published in: CoRR (2021)

Keyphrases

pattern matching
graph matching
pattern matching algorithm
regular expressions
tree matching
boyer moore
approximate pattern matching
matching process
graph theoretic
string matching
weighted graph
graph theory
compressed text
bit parallel
data sets
xml queries
matching strategy
bipartite graph