19 citations · 51 across the 20 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019★ 5 cited
On the Complexity of Exact Pattern Matching in Graphs: Determinism and Zig-Zag Matching
Massimo Equi, Roberto Grossi, Alexandru I. Tomescu +1
Exact pattern matching in labeled graphs is the problem of searching paths of a graph that spell the same string as the given pattern . This basic problem can be…
cs.CC2019
On the Complexity of Exact Pattern Matching in Graphs: Binary Strings and Bounded Degree
Massimo Equi, Roberto Grossi, Veli Mäkinen
Exact pattern matching in labeled graphs is the problem of searching paths of a graph that spell the same string as the pattern . This basic problem can be found…