Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
An algorithm for reporting maximal c-cliques
Theoretical Computer Science
A general model for long-tailed network traffic approximation
The Journal of Supercomputing
A structured P2P network based on the small world phenomenon
The Journal of Supercomputing
Crowd computing: a literature review and definition
Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference
Hi-index | 0.00 |
Utility services provided by cloud computing rely on virtual customer communities forming spontaneously and evolving continuously. Clarifying the explicit boundaries of these communities is thus essential to the quality of utility services in cloud computing. Communities with overlapping features or prominent peripheral vertexes are usually typical irregular communities. Traditional community identification algorithms are limited in discovering irregular topological structures from CR networks, whereas these irregular shapes typically play an important role in finding prominent customers which are ignored in social CRM otherwise. We present a novel method of discovering irregular communities. It firstly finds and merges primitive maximal cliques and the irregular features of overlapping and prominent sparse vertices are further considered. An empirical case and a methodology comparison confirm the feasibility and efficiency of our approach.