There are computationally demanding problems that can be solved by k-clique search algorithms in auxiliary product graphs. The best clique search programs heavily rely upon good colorings. But obtaining a good coloring is a demanding task itself. We present some coloring schemes that exploit the property of the product graph itself and can be constructed with ease. There are indications that using these colorings some hard problems would become feasible.

COBISS.SI-ID: 29895975

In the paper we present an adaptation of the simplex algorithm for the dataflow architecture. In particular, we focus on the pivoting operation. We also experimentally evaluate the proposed algorithm on the big dense linear programs. In the paper we present an adaptation of the simplex algorithm for the dataflow architecture. In particular, we focus on the pivoting operation. We also experimentally evaluate the proposed algorithm on the big dense linear programs.

COBISS.SI-ID: 1537626051

The article presents the difference between the CPU and GPU implementations of an algorithm. It focuses on the problem of matrix multiplication and presents the advantages and disadvantages of using the GPU. A comparison made in this paper also suggests the possibility of using GPU to implement graph algorithms.

COBISS.SI-ID: 1537552067