This paper introduces and studies the maximum k-plex problem, which arises in social network analysis, but can also be used in several other important application areas, including wireless networks,â€¦ (More)

This paper proposes clique relaxations to identify clusters in biological networks. In particular, the maximum n-clique and maximum n-club problems on an arbitrary graph are introduced and theirâ€¦ (More)

Weconsider a network representation of the stockmarket data referred to as themarket graph,which is constructed by calculating cross-correlations between pairs of stocks based on the opening pricesâ€¦ (More)

Computing the chromatic number of a graph is an NP-hard problem. For random graphs and some other classes of graphs, estimators of the expected chromatic number have been well studied. In this paper,â€¦ (More)

Two continuous formulations of the maximum independent set problem on a graph G = (V ,E) are considered. Both cases involve the maximization of an n-variable polynomial over the n-dimensionalâ€¦ (More)

Ad hoc wireless network is featured by dynamic topology. The re is no fixed infrastructure as compared with wired network. Every host can move to any direction at any speed. This characteristic putsâ€¦ (More)