6 citations · 7 across the 9 of their papers we have counts for
5 papers · 1 filter
Minimum Path Cover in Parameterized Linear Time
Manuel Caceres, 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…
Minimum Flow Decomposition in Graphs with Cycles using Integer Linear Programming
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
Minimum flow decomposition (MFD) -- the problem of finding a minimum set of weighted source-to-sink paths that perfectly decomposes a flow -- is a classical problem in Computer Sci…
Width Helps and Hinders Splitting Flows
Manuel Cáceres, Massimo Cairo, Andreas Grigorjew +5
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation on a directed graph into weighted source-to-sink p…
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…
Fast, Flexible, and Exact Minimum Flow Decompositions via ILP
Fernando H. C. Dias, Lucia Williams, Brendan Mumey +1
Minimum flow decomposition (MFD) (the problem of finding a minimum set of paths that perfectly decomposes a flow) is a classical problem in Computer Science, and variants of it are…