FP-GraphMiner-A Fast Frequent Pattern Mining Algorithm for Network Graphs. - Ramasamy Vijayalakshmi; Nadarajan Rethnasamy; John F. Roddick; M. Thilaga; Parisutham Nirmala (J. Graph Algorithms Appl., 2011)

An algorithm to search edge relaxed query graph with minimum support threshold in large communication networks. - Parisutham Nirmala; Nadarajan Rethnasamy (COMSNETS, 2016)

Centrality measures-based algorithm to visualize a maximal common induced subgraph in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

Vertex cover-based binary tree algorithm to detect all maximum common induced subgraphs in large communication networks. - Parisutham Nirmala; Lekshmi Ramasubramony Sulochana; Nadarajan Rethnasamy (Knowl. Inf. Syst., 2016)

TCPP-2PPIN: trustworthy centrality prediction paradigm for analyzing two protein-protein interaction networks using centrality measures and graph theory concepts. - Parisutham Nirmala; Blesson Deep; G. Aswin (Netw. Model. Anal. Health Informatics Bioinform., 2024)