Post #97

Deep Weisfeiler Leman Surprisingly this paper is not about applying deep neural networks to Weisfeiler Lehman algorithm. It's quite technical but well-written and I could understand the main results and ideas of the paper. They propose an extension of k-WL algorithm, when instead of adding all k-tuples to the input graph at each iteration, they add only a subset of k-tuples. Because you reduce the size of the graph comparing to the original k-WL algorithm, your DeepWL algorithm becomes more efficient, and hence they show that it can solve some graphs in polynomial time that original k-WL algorithm cannot (in particular CFI graphs).