Recent advances in information science have shown that linked data pervade our society and the natural world around us. Graphs have become increasingly important for representing complicated structures such as Wikipedia, Freebase, and various social networks. However, existing algorithms cannot handle large graphs efficiently, so fast algorithms are needed. We introduce two fast algorithms. They outperform previous algorithms in terms of both speed and quality. Our algorithms are fundamental to many applications. Our algorithms allow many applications to be processed more efficiently and will help to improve the effectiveness of future applications.

Please click the thumbnail image to open the full-size PDF file.