Wireless networks operate in environments with unknown and time-varying characteristics.
The changing nature of many of these characteristics will significantly affect network …

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 …

Community structure is an important feature in complex networks which has great significant
for organization of networks. The community detection is the process of partitioning the …

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 …

One of the problems with traditional genetic algorithms (GAs) is premature convergence,
which makes them incapable of finding good solutions to the problem. The memetic …

The recent years have witnessed the birth and explosive growth of the Web. The exponential
growth of the Web has made it into a huge source of information wherein finding a document …

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