We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...
The problem of evaluating the dominant eigenvalue of real matrices using Monte Carlo numerical methods is considered. Three almost optimal Monte Carlo algorithms are presented:
Ivan Dimov, Vassil N. Alexandrov, Aneta Karaivanov...
In developing High-Performance Computing (HPC) software, time to solution is an important metric. This metric is comprised of two main components: the human effort required develo...
In this paper, we study a synchronous execution strategy f o r parallel join computation in multiprocessor systems. Through a further comprehensive investigation of the processor ...