Revised 28th May 2017, Accepted 14th Jun 2017, Online 30th Jun 2017 Abstract—There
are different number of optimization problems are present those are NP problems. Graph …

Many practical applications include image processing, space searching, network analysis,
graph partitioning etc. in that large graphs having a millions of vertices are commonly used …

Many problems that were considered complex and unsolvable have started to solve and
new technologies have emerged through to the development of GPU technology. Solutions …

Graph data structure is a collection of vertices and edges. Graph is utilized to model objects
in social network and web graph. In practical computing many applications are work with …

Travelling tournament problem (TTP) is evolved NP-hard problem from its similarity to
Travelling Salesman problem.(TSP). TTP aims to solve optimization of objectives to …

In this paper, we present a novel approach named “ACO-PSO-TSP-GPU” to run PSO and
ACO on Graphical Processing Units (GPUs) and applied to TSP (Parallel-PSO&ACO-A …

Combinatorial optimization problems are often NP-hard and too complex to be solved within
a reasonable time frame by exact methods. Heuristic methods, which do not offer a …

CPU-GPU based cluster computing in today's modern world encompasses the domain of
complex and high-intensity computation. To exploit the efficient resource utilization of a …

Travelling Salesman Problem is a very popular problem in graph theory and it is applicable
to solve many problems of science and engineering. It has its applications in electronics …

In the digital world, the demand for data security during communication has increased. Hash
functions are one of the cryptographic algorithms that provide data security in terms of data …