Algorithms and methods on complete dense bipartite graph are presented in this document for emerging small communities - websites which mention a common subject. These methods allow finding communities, which would not be found by HITS or CLEVER algorithm.
This dissertations presents an algorithm on the webgraph for finding dense bipartite graphs wich represents web-communities.
By performing further steps of the algorithm several levels of communities are recognized which can be related to communites of former levels.
The authors of this document define a community consisting of several web sites with a common subject.
They explain an algorithm for crawling the web for communities using a maximum flow algorithm of the web graph