Conference
Jul 2026
String Matching in (Block) Graphs: A Full Classification by Walk Length
A near-linear-time algorithm is given and there is no combinatorial algorithm improving over the state-of-the-art $\mathcal{O}(m|E| + N)$ bound for any $b\ge 4$.
Sebastian Angrick, B. Bals, Paweł Gawrychowski et al.
· Embedded Systems and Applica... · 0 citations