6 citations · 6 across the 2 of their papers we have counts for
2 papers
q-bio.GN2022★ 6 cited
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…
cs.DM2010
On cycles through two arcs in strong multipartite tournaments
Alexandru I. Tomescu
A multipartite tournament is an orientation of a complete -partite graph. In [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite tournaments, Appl…