Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings Christopher Morris Gaurav Rattan Petra Mutzel

Aug-17-2025, 08:36:56 GMT–Neural Information Processing Systems 

Hence, the running time of each iteration does not take the sparsity of a given graph into account.