Fig. 2From: A family of tractable graph metricsFraction of triangle inequality violations (TIVs) for different algorithms on random graphs of different types and sizes (a n = 10, b n = 50, c n =100): DSL1, DSL2, ORTHOP, and ORTHOP, are not shown since, as pseudometrics, they have zero TIVs. a n=10, b n=50, c n=100Back to article page