Node Similarity Measures 

There are many problems where objects lend themselves to be represented easily using graphs. For example, scientific publications are linked together by citations.
In cases like this, similarity between the objects represented as nodes can be computed using the structure of the graph. The algorithms take advantage
of the local neighborhood of the nodes in order to compute the similarity. Refer to the papers for a description of the various algorithms.
Here is a README which explains the algorithms implemented, instructions for usage and input data format. Click here to download the package References
