Self-organization is a great concept for building scalable systems consisting of huge
numbers of subsystems. The primary objectives are coordination and collaboration on a …

This paper introduces and studies the maximum k-plex problem, which arises in social
network analysis and has wider applicability in several important areas employing graph …

Self-Organization in Sensor and Actor Networks explores self-organization mechanisms and
methodologies concerning the efficient coordination between intercommunicating …

Self-organization is a great concept for building scalable systems consisting of a huge
number of subsystems. The primary objectives are improved scalability and dynamic …

The minimum independent dominance set (MIDS) problem is an important version of the
dominating set with some other applications. In this work, we present an improved master …

Clique relaxation models that were originally introduced in the literature on social network
analysis are not only gaining increasing popularity in a wide spectrum of complex network …

Listing dense subgraphs in large graphs plays a key task in varieties of network analysis
applications like community detection. Clique, as the densest model, has been widely …

In this paper a new clustering algorithm for vehicular ad-hoc networks (VANET) is presented.
The proposed solution is a modification of the Basagnipsilas distributed and mobility …

In this paper we present a new multilevel clustering algorithm for Vehicular Ad-Hoc
Networks (VANET), which we call the Density Based Clustering (DBC). Our solution is …

This chapter aims to provide a detailed survey of existing graph models and algorithms for
important problems that arise in different areas of wireless telecommunication. In particular …