302 citations · 303 across the 4 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
Christopher Morris, Gaurav Rattan, Petra Mutzel
Graph kernels based on the -dimensional Weisfeiler-Leman algorithm and corresponding neural architectures recently emerged as powerful tools for (supervised) learning with graph…
cs.DS2019
Maximum Cut Parameterized by Crossing Number
Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke +3
Given an edge-weighted graph on nodes, the NP-hard Max-Cut problem asks for a node bipartition such that the sum of edge weights joining the different partitions is maximiz…