5 citations · 6 across the 5 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
Massimo Equi, Veli Mäkinen, Alexandru I. Tomescu
We consider the following string matching problem on a node-labeled graph : given a pattern string , decide whether there exists a path in whose concatenation of no…
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…