On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree

Document type :
Conference papers
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-02338498
Contributor : Marie-France Sagot <>
Submitted on : Wednesday, October 30, 2019 - 8:51:23 AM
Last modification on : Thursday, November 14, 2019 - 2:31:27 PM

File

1901.05264.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02338498, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

16

Files downloads

182