Login / Signup

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

Nicola Cotumaccio
Published in: DCC (2022)
Keyphrases
  • pattern matching
  • graph matching
  • string matching
  • pattern matching algorithm
  • boyer moore