This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum subsequence is a contiguous subsequence with ...

Let G = (V, E) be an undirected graph, where V is the vertex set and E is the edge set. A subset M of E is an induced matching of G if M is a matching of G and no two edges in M are joined by an edge.