slides (in Russian) pptx or pdf
A review of the most important families for graph distances.
I review 5 algorithms for computing graph distances. Here I provide a full list with some extra pointers.
- WL kernel paper
- NetSimile paper
- NetLSD paper + SLaQ paper code
- DDGK paper
- InfoGraph paper