A Comparative Study of Algorithms for Finding Web Communities


Recently, researches on extraction of densely connected subgraphs, which are called communities, from the graph representing link structure inWWW, are very popular. However, few methods guarantee that extracted subgraphs satisfy community conditions which are strictly defined. In this paper, we consider the problem of extracting subgraphs that strictly… (More)
DOI: 10.1109/ICDE.2005.159


4 Figures and Tables