The classical Weisfeiler-Leman algorithm aka color refinement is fundame...
We introduce the temporal graphlet kernel for classifying
dissemination ...
Random walk kernels have been introduced in seminal work on graph learni...
We propose the Temporal Walk Centrality, which quantifies the importance...
In recent years, algorithms and neural architectures based on the
Weisfe...
The graph edit distance is an intuitive measure to quantify the dissimil...
Finding the graphs that are most similar to a query graph in a large dat...
In recent years, algorithms and neural architectures based on the
Weisfe...
Recently, there has been an increasing interest in (supervised) learning...
This work presents a two-stage neural architecture for learning and refi...
Kernels for structured data are commonly obtained by decomposing objects...
Graph kernels have become an established and widely-used technique for
s...
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
Finding an optimal assignment between two sets of objects is a fundament...
We propose two fixed-parameter tractable algorithms for the weighted Max...
Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for...
The largest common embeddable subtree problem asks for the largest possi...
We propose a fixed-parameter tractable algorithm for the Max-Cut
problem...
The cuneiform script constitutes one of the earliest systems of writing ...
Non-linear kernel methods can be approximated by fast linear ones using
...
While state-of-the-art kernels for graphs with discrete labels scale wel...
The success of kernel methods has initiated the design of novel positive...