Graph::Similarity::CoupledNodeEdgeScoring - Coupled Node-Edge Scoring implementation
Please see Graph::Similarity
This is the implementation of the below papers.
Vincent D. Blondel "A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching"
Laura Zager "Graph Similarity and Matching"
This calculates Coupled Node-Edge Scoring. The algorithm is mentioned in Page.655 in Blondel's paper. The convergence is not taken into account. Please set the number of iteration instead.
<shoheik at cpan.org>
Copyright 2012 Shohei Kameda.
This program is free software; you can redistribute it and/or modify it under the terms of either: the GNU General Public License as published by the Free Software Foundation; or the Artistic License.
See http://dev.perl.org/licenses/ for more information.