25 citations · 68 across the 6 of their papers we have counts for
8 papers
An Efficient Construction of Completely Independent Spanning Trees in Dense Gaussian Networks
Zaid Hussain, Fawaz AlAzemi, Bader AlBdaiwi
Fault tolerance in routing and broadcasting is a critical aspect in ensuring the reliability and robustness of communication networks, particularly in environments prone to failure…
Independent Spanning Trees in Eisenstein-Jacobi Networks
Zaid Hussain, Hosam AboElFotoh, Bader AlBdaiwi
Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applic…
Node-Independent Spanning Trees in Gaussian Networks
Zaid Hussain, Bader AlBdaiwi, Anton Cerny
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all t…
A GPU-Based Genetic Algorithm for the P-Median Problem
Bader F. AlBdaiwi, Hosam M. F. AboElFotoh
The p-median problem is a well-known NP-hard problem. Many heuristics have been proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel computing pl…
On the Number of Cycles in a Graph
Bader F. AlBdaiwi
There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper pre…
Heuristics for the Variable Sized Bin Packing Problem Using a Hybrid P-System and CUDA Architecture
Qadha'a AlEnezi, Hosam AboElFotoh, Bader AlBdaiwi +1
The Variable Sized Bin Packing Problem has a wide range of application areas including packing, scheduling, and manufacturing. Given a list of items and variable sized bin types, t…
Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks
Bader AlBdaiwi, Zaid Hussain, Anton Cerny +1
Independent trees are used in building secure and/or fault-tolerant network communication protocols. They have been investigated for different network topologies including tori. De…
Diameter Perfect Lee Codes
Peter Horak, Bader F. AlBdaiwi
Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-corr…