Strongly Connected Components Detection in Open Directory Project Graphs

Abstract

The Strongly Connected Components Detection Algorithm is a powerful tool for identifying representative subsets on big communities. By means of a graph representation, smaller groups of nodes related to each other by some particular feature can be obtained. In this work, we propose to apply this algorithm to the Open Directory Project (ODP) graph to identify topical communities of web pages. The challenge of this research work is to find groups of topics strongly connected to each other, which will enable us to perform further similarity studies between web pages from ODP. We discuss some findings observed from the application of this algorithm to the ODP graph.