1. A computer program product comprising a non-transitory tangible machine-readable medium that stores a program, the program being executable by a machine to perform a method of identifying a common subgraph between first and second networks, the first network G 1 having a set of nodes V 1 and a set of edges E 1 , the second network G 2 having a set of nodes V 2 and a set of edges E 2 , where N(a) is a set of neighbors of a given node a, the set being of size |N(a)|, with each edge e of a network having an edge weight w(e), the method comprising: for each of a set of node pairs (i, j), where i is a node from the first network and j is a node from the second network, and where u is a neighbor of i and v is a neighbor of j, computing a similarity score; selecting from the similarity scores a set of scores that capture mutually-consistent pairwise matches; and extracting node mappings from the set of scores to identify one or more conserved edges between the first and second network.