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 ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...

In recent years, research and development on quantum computers has made considerable progress. Quantum chemical calculations for electronic structures of atoms and molecules are attracting great ...