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

Nicola Cotumaccio

Browse the full DCC paper archive.