Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

There is a kind of link algorithm that isn’t widely discussed, not nearly enough. This article is meant as introduction to link and link distance ranking algorithms. It’s something that may play a ...