The Graph Coloring Problem (GCP) is a significant optimization challenge widely suitable to
solve scheduling problems. Its goal is to specify the minimum colors (k) required to color a …

In wireless ad hoc networks, due to the dynamic topology changes, multi hop
communications and strict resource limitations, routing becomes the most challenging issue …

This book is written for computer engineers, scientists, and students studying/working in
reinforcement learning and artificial intelligence domains. The book collects recent …

During the last decades, many studies have been conducted on multicast routing in mobile
ad hoc networks (MANET) and a host of algorithms have been proposed. In existing …

Recently, several studies have been conducted to design mobility-based multicast routing
protocols for wireless mobile ad hoc networks (MANET). These protocols assume that the …

5,859,835 A 1/1999 Varma et al. 2 ()() 2/() 126671 A1 9/2002 Ellis et al. 5926458 A 7/1999
Yin et¿ 1, 2 ()() 2/() 136 268 A 1 9/2002 Gan et al. 6.252. 876 B 1 6/2001 Brueckheimer et al …

In the last decade, numerous efforts have been devoted to design efficient algorithms for
clustering the wireless mobile ad-hoc networks (MANET) considering the network mobility …

Vertex coloring problem is a combinatorial optimization problem in which a color is assigned
to each vertex of the graph such that no two adjacent vertices have the same color. Cellular …

During the last decades, a host of efficient algorithms have been developed for solving the
minimum spanning tree problem in deterministic graphs, where the weight associated with …

Due to the massive amount of heterogeneous information on the web, insufficient and vague
user queries, and use of the same query by different users for different aims, the information …