This project implements several graph algorithms to uncover structural properties of the network, identify influential nodes, and detect communities. The analysis is performed on the Facebook dataset ...

Abstract: In the era of information explosion, clustering analysis of graph-structured data and empty graph-structured data is of great significance for extracting the intrinsic value of data. From ...

Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...

Abstract: Graph matching is a widely studied and applied field, with Graph Edit Distance (GED) serving as a fundamental metric for evaluating the similarity between graphs. As an NP-hard problem in ...