On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Dates and versions

hal-02338498 , version 1 (30-10-2019)

Identifiers

  • HAL Id : hal-02338498 , version 1

Cite

Massimo Equi, Roberto Grossi, Veli Makinen. On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree. ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Jul 2019, Patras, Greece. pp.1-15. ⟨hal-02338498⟩

Collections

INRIA INRIA2
25 View
134 Download

Share

Gmail Facebook Twitter LinkedIn More