Corpus ID: 91184223

Towards a practical k-dimensional Weisfeiler-Leman algorithm

@article{Morris2019TowardsAP,
  title={Towards a practical k-dimensional Weisfeiler-Leman algorithm},
  author={C. Morris and Petra Mutzel},
  journal={ArXiv},
  year={2019},
  volume={abs/1904.01543}
}
  • C. Morris, Petra Mutzel
  • Published 2019
  • Computer Science, Mathematics
  • ArXiv
  • The $k$-dimensional Weisfeiler-Leman algorithm is a well-known heuristic for the graph isomorphism problem. Moreover, it recently emerged as a powerful tool for supervised graph classification. The algorithm iteratively partitions the set of $k$-tuples, defined over the set of vertices of a graph, by considering neighboring $k$-tuples. Here, we propose a \new{local} variant which considers a subset of the original neighborhood in each iteration step. The cardinality of this local neighborhood… CONTINUE READING
    Provably Powerful Graph Networks
    58
    Algorithmic Data Science

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 47 REFERENCES
    Glocalized Weisfeiler-Lehman Graph Kernels: Global-Local Feature Maps of Graphs
    29
    Lovász Meets Weisfeiler and Leman
    18
    Weisfeiler-Lehman Graph Kernels
    772
    Provably Powerful Graph Networks
    58
    Sherali-Adams relaxations of graph isomorphism polytopes
    26
    Fast Algorithm for Graph Isomorphism Testing
    21
    Graph Isomorphism in Quasipolynomial Time
    • L. Babai
    • Computer Science, Mathematics
    • 2015
    312
    Sherali-Adams relaxations and indistinguishability in counting logics
    49
    Dimension Reduction via Colour Refinement
    38
    A survey on graph kernels
    39