Skip to main content

Timeline for Similarity of weighted graphs

Current License: CC BY-SA 2.5

4 events
when toggle format what by license comment
Dec 1, 2010 at 9:43 vote accept jojovilco
Sep 11, 2010 at 1:13 comment added Louigi Addario-Berry The weights (assuming they are non-negative) always give you a metric space. The definition of the distance between two vertices is the total weight on the lightest path between them.
Sep 11, 2010 at 0:17 comment added Thierry Zell It might not work very well if the weights do not give you a metric space: what about the triangle inequality?
Sep 10, 2010 at 14:41 history answered Louigi Addario-Berry CC BY-SA 2.5