|
|
|
|
|
Qinghai Li and Chang Wu Yu
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed to multiple processing systems by usin...
ver más
|
|
|
|
|
|
|
|
|
|
|
Agus Irawan, Asmiati Asmiati, La Zakaria and Kurnia Muludi
The locating-chromatic number of a graph combines two graph concepts, namely coloring vertices and partition dimension of a graph. The locating-chromatic number is the smallest k such that G has a locating k-coloring, denoted by ????(??)
?
L
(
G
)
. This...
ver más
|
|
|
|
|
|
|
|
|
|
|
Derek H. Smith, Roberto Montemanni and Stephanie Perkins
Let ??=(??,??)
G
=
(
V
,
E
)
be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Sebastian Berndt
Parameterized complexity theory has led to a wide range of algorithmic breakthroughs within the last few decades, but the practicability of these methods for real-world problems is still not well understood. We investigate the practicability of one of th...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuri N. Sotskov and Evangelina I. Mihova
This article extends the scheduling problem with dedicated processors, unit-time tasks, and minimizing maximal lateness ??max
L
max
for integer due dates to the scheduling problem, where along with precedence constraints given on the set ??={??1,??2,??,...
ver más
|
|
|
|
|
|