|
|
|
|
|
Jong-Shin Chen, Ruo-Wei Hung, Fatemeh Keshavarz-Kohjerdi and Yung-Fa Huang
Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied the Hamiltonian-related properties of supergrid graphs and their subclasses of graphs. In this paper, we propose a generalized graph...
ver más
|
|
|
|
|
|
|
|
|
|
|
Evangelia Fragkou, Dimitrios Papakostas, Theodoros Kasidakis and Dimitrios Katsaros
The Internet of Battlefield Things is a newly born cyberphysical system and, even though it shares a lot with the Internet of Things and with ad hoc networking, substantial research is required to cope with its scale and peculiarities. This article exami...
ver más
|
|
|
|
|
|
|
|
|
|
|
Miroslaw Kowaluk and Andrzej Lingas
We introduce the concept of a k-dimensional matrix product D of k matrices A1,…,Ak" role="presentation">??1,?,????A1,?,Ak
A
1
,
?
,
A
k
of sizes n1×n,…,nk×n," role="presentation">??1×??,?,????×??,n1×n,?,nk×n,
n
1
...
ver más
|
|
|
|
|
|
|
|
|
|
|
Salim Bouamama and Christian Blum
This paper presents a performance comparison of greedy heuristics for a recent variant of the dominating set problem known as the minimum positive influence dominating set (MPIDS) problem. This APX-hard combinatorial optimization problem has applications...
ver más
|
|
|
|
|
|
|
|
|
|
|
Samir Balbal, Salim Bouamama and Christian Blum
Dominating sets are among the most well-studied concepts in graph theory, with many real-world applications especially in the area of wireless sensor networks. One way to increase network lifetime in wireless sensor networks consists of assigning sensors...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jonathan Li, Rohan Potru and Farhad Shahrokhi
We implement and test the performances of several approximation algorithms for computing the minimum dominating set of a graph. These algorithms are the standard greedy algorithm, the recent Linear programming (LP) rounding algorithms and a hybrid algori...
ver más
|
|
|
|
|
|
|
|
|
|
|
Abdel-Rahman Hedar, Shada N. Abdulaziz, Adel A. Sewisy and Gamal A. El-Sayed
An efficient routing using a virtual backbone (VB) network is one of the most significant improvements in the wireless sensor network (WSN). One promising method for selecting this subset of network nodes is by finding the minimum connected dominating se...
ver más
|
|
|
|
|
|
|
|
|
|
|
Wenxing Lai
Chen and Flum showed that any FPT-approximation of the k-Clique problem is not in para-??????
AC
0
and the k-DominatingSet (k-DomSet) problem could not be computed by para-??????
AC
0
circuits. It is natural to ask whether the ??(??)
f
(
k
)
-approxima...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zulfiqar Ali Zardari, Jingsha He, Nafei Zhu, Khalid Hussain Mohammadani, Muhammad Salman Pathan, Muhammad Iftikhar Hussain and Muhammad Qasim Memon
A mobile ad-hoc network (MANET) is a temporary network of wireless mobile nodes. In a MANET, it is assumed that all of the nodes cooperate with each other to transfer data packets in a multi-hop fashion. However, some malicious nodes don?t cooperate with...
ver más
|
|
|
|
|
|
|
|
|
|
|
Md. Anisuzzaman Siddique, Hao Tian, Mahboob Qaosar and Yasuhiko Morimoto
The skyline query and its variant queries are useful functions in the early stages of a knowledge-discovery processes. The skyline query and its variant queries select a set of important objects, which are better than other common objects in the dataset....
ver más
|
|
|
|
|
|