"On the Complexity of String Matching for Graphs."

Massimo Equi et al. (2019)
a service of Schloss Dagstuhl - Leibniz Center for Informatics