Description
This is an efficient C++ implementation to compute the Weisfeiler Lehman Kernel of two large networks, potentially weighted.
1. Based on Shervashidze's paper "Weisfeiler-Lehman Graph Kernels".
2. This implementation uses the MD5 hashing from Brumme's Hashing Library.
3. (Integer) weighted edges are multi-edges: the label passing through an edge of weight k is duplicated k times.
**External deposit with Zenodo and GitHub**
1. Based on Shervashidze's paper "Weisfeiler-Lehman Graph Kernels".
2. This implementation uses the MD5 hashing from Brumme's Hashing Library.
3. (Integer) weighted edges are multi-edges: the label passing through an edge of weight k is duplicated k times.
**External deposit with Zenodo and GitHub**
Date made available | 23 May 2022 |
---|---|
Publisher | Zenodo |
Date of data production | 18 May 2022 |