Dear all, I am using an algorithm to compare networks based on the shortest-paths and diameter measures, but, of course, it seems to be very slow for large graphs.
If I remember right, some months ago somebody posted here about measures to compare networks. I looked for this post in the historial of the list, but I didn't find it, sorry. Does anyone know an algorithm to measure the difference/similarity between a pair of networks? Is there any algorithm like this implemented for Igraph? Thank you very much for your attention! Best regards, Charles Novaes de Santana -- Um axé! :) -- Charles Novaes de Santana http://www.imedea.uib-csic.es/~charles PhD student - Global Change Laboratorio Internacional de Cambio Global Department of Global Change Research Instituto Mediterráneo de Estudios Avanzados(CSIC/UIB) Calle Miquel Marques 21, 07190 Esporles - Islas Baleares - España Office phone - +34 971 610 896 Cell phone - +34 660 207 940 _______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
