Journal of Information Technology & Software Engineering
Open Access

An improved heuristic algorithm for finding a k-club in an undirected graph

Global Summit and Expo on Multimedia & Applications

August 10-11, 2015 Birmingham, UK

Yu-Fen Zeng

Scientific Tracks Abstracts: J Inform Tech Soft Engg

Abstract :

With the rise of social network website (e.g., Facebook and Twitter), the research of social network analysis (SNA) has
been getting more attention. A common problem is to identify community or organizations in network. In graph theory
perspective, that is to find a dense structure in graph. For a graph G= (V, E), a k-club W of G is a subgraph of G induced by
W, such that the diameter of W is k. This structure plays an important role in social network. In this paper, we introduce two
common algorithms which are Constellation and Drop. We also present several improved version of Constellation and Drop.
And finally, we derive an improved algorithm based On Constellation. The comparison result of our algorithm and other
existing improved algorithm is shown at last.

Biography :

Yu-Fen Zeng is working on her Master dissertation from Shu-Te University. She is a graduate student majoring in computer science information engineering.