Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
P Gawrychowski, E Gorbachev… - arXiv preprint arXiv …, 2024 - arxiv.org
The task of min-plus matrix multiplication often arises in the context of distances in graphs
and is known to be fine-grained equivalent to the All-Pairs Shortest Path problem. The non …
and is known to be fine-grained equivalent to the All-Pairs Shortest Path problem. The non …
An efficient hybrid MPI-OpenMP based parallel approach for longest common subsequence
A Yadav, A Khan, M Ahmed - 27th International Conference on …, 2023 - ieeexplore.ieee.org
In the area of bio-informatics and pattern recognition, sequence alignment and pattern
matching are important operations, respectively. Finding the Longest Common …
matching are important operations, respectively. Finding the Longest Common …