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.