|
|
|
|
|
Isnaini Rosyida and Christiana Rini Indrati
The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs), and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Alon Ascoli, Martin Weiher, Melanie Herzig, Stefan Slesazeck, Thomas Mikolajick and Ronald Tetzlaff
This manuscript provides a comprehensive tutorial on the operating principles of a bio-inspired Cellular Nonlinear Network, leveraging the local activity of NbOx
x
memristors to apply a spike-based computing paradigm, which is expected to deliver such a...
ver más
|
|
|
|
|
|
|
|
|
|
|
Woojin Song and Jaesung Park
In this paper, we propose a channel assignment method that can mitigate the inter-WBAN interference when the density of WBANs is high. To achieve the goal, we group the coexisting WBANs into a set of clusters by using the Louvain algorithm and allocate d...
ver más
|
|
|
|
|
|
|
|
|
|
|
Viktor Uglev and Oleg Sychev
The article discusses the problem of visualization of complex multiparameter systems, defined by datasets on their structure, functional structure, and activity in the form of complex graphs and transition of traditional representation of the data acquir...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Max Bannach and Till Tantau
Color coding is an algorithmic technique used in parameterized complexity theory to detect ?small? structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pat...
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Frank Gurski, Dominique Komander and Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,...
ver más
|
|
|
|
|
|