Hi all,


I would like to know if there is a way to compute some measure of similarity between two ordinary graphs with weighted edges. Graphs do not share vertices and can differ in number of vertices and edges.


Any hints, suggestions and thoughts are highly appreciated.


Best,
Jozef



Similarity of weighted graphs
If you view the weights as edge lengths then you can view each graph as a metric space, and then use the [Gromov-Hausdorff](http://en.wikipedia.org/wiki/Gromov%E2%80%93Hausdorff_convergence) distance between the two metric spaces. This may not be at all suitable for your application but it has been very useful in my own research. 


