Finding, Counting, and Highlighting all Triangles in Large Graphs

Graphs are extensively used structure in computer network and various computing applications. Internet, social networks, bioinformatics and many other complicated structures are modeled as graphs. Counting the number of triangles in a graph is an indispensable problem with various applications of modern computing system. Now a day, triangle counting problem of graph is used widely in network analysis. Due to the very large size of networks like the internet and other social networks, the efficiency of algorithms for triangle counting and listing is very important. Counting triangles within graphs with millions and billions of edges requires efficient algorithms which run faster, use a small amount of space and provide accurate estimates of the number of triangles. Here we propose an algorithm that meets all the above criteria. Our algorithm is an enhancement of the existing best algorithms and tries to find and count triangles and to highlight (by JUNG tool) the triangles in huge networks.