2 papers
cs.DS2022
Fast Circular Pattern Matching
Will Solow, Matthew Barich, Brendan Mumey
The Exact Circular Pattern Matching (ECPM) problem consists of reporting every occurrence of a rotation of a pattern in a text . In many real-world applications, specificall…
cs.DS2021
Sparsifying, Shrinking and Splicing for Minimum Path Cover in Parameterized Linear Time
Manuel Cáceres, Massimo Cairo, Brendan Mumey +2
A minimum path cover (MPC) of a directed acyclic graph (DAG) is a minimum-size set of paths that together cover all the vertices of the DAG. Computing an MPC is a basic…