Parallel algorithms for singular value decomposition (SVD) have risen to prominence as an indispensable tool in high-performance numerical linear algebra. They offer significant improvements in the ...

We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...

Hu and Torres have proposed a decomposition algorithm for finding the shortest paths between all pairs of nodes in a sparse network in which subnetworks are linearly overlapped. The purpose of this ...