@inproceedings{equi:hal-02338498, TITLE = {{On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree}}, AUTHOR = {Equi, Massimo and Grossi, Roberto and Makinen, Veli}, URL = {https://inria.hal.science/hal-02338498}, BOOKTITLE = {{ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming}}, ADDRESS = {Patras, Greece}, PAGES = {1-15}, YEAR = {2019}, MONTH = Jul, KEYWORDS = {labeled graphs ; string matching ; string search ; strong exponential time hypothesis ; variation graphs ; 2012 ACM Subject Classification Mathematics of computing $\rightarrow$ Graph algorithms Theory of computation $\rightarrow$ Problems ; exact pattern matching ; graph query ; graph search ; heterogeneous networks}, PDF = {https://inria.hal.science/hal-02338498/file/1901.05264.pdf}, HAL_ID = {hal-02338498}, HAL_VERSION = {v1}, }