Nicola Cotumaccio. Graphs can be succinctly indexed for pattern matching in $O(\vert E\vert ^{2}+\vert V\vert ^{5/2})$ time. In Ali Bilgin, Michael W. Marcellin, Joan Serra-Sagristà, James A. Storer, editors, Data Compression Conference, DCC 2022, Snowbird, UT, USA, March 22-25, 2022. pages 272-281, IEEE, 2022. [doi]
Abstract is missing.