Lower Bounds for Weisfeiler-Leman

Zenodo (CERN European Organization for Nuclear Research)

Abstract

We show a range of hardness results for the Weisfeiler--Leman algorithm.

Authors 4

1. Radu Curticapean

   Computer Algorithms for Medicine · IT University of Copenhagen

   Affiliation as printed

   IT University of Copenhagen and Basic Algorithms Research Copenhagen

2. Mingjun Liu

   Shanghai Jiao Tong University

   Affiliation as printed

   Shanghai Jiao Tong University

3. Daniel Neuen

   Max Planck Institute for Informatics

   Affiliation as printed

   Max Planck Institute for Informatics

4. Tim Seppelt Aachen

   IT University of Copenhagen · RWTH Aachen University

   Affiliation as printed

   RWTH Aachen University

   IT University of Copenhagen