389 citations · 1.1k across the 26 of their papers we have counts for
5 papers · 1 filter
Temporal Graph Kernels for Classifying Dissemination Processes
Lutz Oettershagen, Nils M. Kriege, Christopher Morris +1
Many real-world graphs or networks are temporal, e.g., in a social network persons only interact at specific points in time. This information directs dissemination processes on the…
Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning
Nils M. Kriege
Kernels for structured data are commonly obtained by decomposing objects into their parts and adding up the similarities between all pairs of parts measured by a base kernel. Assig…
A Survey on Graph Kernels
Nils M. Kriege, Fredrik D. Johansson, Christopher Morris
Graph kernels have become an established and widely-used technique for solving classification tasks on graphs. This survey gives a comprehensive overview of techniques for kernel-b…
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…
Computing Optimal Assignments in Linear Time for Approximate Graph Matching
Nils M. Kriege, Pierre-Louis Giscard, Franka Bause +1
Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural…