Abstract: 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 ...

Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow We present an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially ...

Implementation of a solution to the consecutive subsequence problem, using Kadane's algorithm, made in C language for an exercise of the subject Design and Analysis of Algorithms at UFSCar - So ...

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 subseque ...

I write algorithms that I learn. Contribute to uriha421/introduction_to_algorithms development by creating an account on GitHub.

The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean ...