research
∙
09/19/2022
Gradual Weisfeiler-Leman: Slow and Steady Wins the Race
The classical Weisfeiler-Leman algorithm aka color refinement is fundame...
share
research
∙
09/12/2022
A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks
We introduce the temporal graphlet kernel for classifying dissemination ...
research
∙
05/22/2022
Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited
Random walk kernels have been introduced in seminal work on graph learni...
research
∙
02/08/2022
Temporal Walk Centrality: Ranking Nodes in Evolving Networks
We propose the Temporal Walk Centrality, which quantifies the importance...
research
∙
12/18/2021
Weisfeiler and Leman go Machine Learning: The Story so far
In recent years, algorithms and neural architectures based on the Weisfe...
research
∙
11/15/2021
EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases
The graph edit distance is an intuitive measure to quantify the dissimil...
research
∙
10/04/2021
Metric Indexing for Graph Similarity Search
Finding the graphs that are most similar to a query graph in a large dat...
research
∙
05/12/2021
The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs
In recent years, algorithms and neural architectures based on the Weisfe...
research
∙
07/16/2020
TUDataset: A collection of benchmark datasets for learning with graphs
Recently, there has been an increasing interest in (supervised) learning...
research
∙
01/27/2020
Deep Graph Matching Consensus
This work presents a two-stage neural architecture for learning and refi...
research
∙
08/19/2019
Deep Weisfeiler-Lehman Assignment Kernels via Multiple Kernel Learning
Kernels for structured data are commonly obtained by decomposing objects...
research
∙
03/28/2019
A Survey on Graph Kernels
Graph kernels have become an established and widely-used technique for s...
research
∙
03/14/2019
Maximum Cut Parameterized by Crossing Number
Given an edge-weighted graph G on n nodes, the NP-hard Max-Cut problem a...
research
∙
01/29/2019
Computing Optimal Assignments in Linear Time for Graph Matching
Finding an optimal assignment between two sets of objects is a fundament...
research
∙
11/29/2018
Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs
We propose two fixed-parameter tractable algorithms for the weighted Max...
research
∙
05/28/2018
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for...
research
∙
05/02/2018
Largest Weight Common Subtree Embeddings with Distance Penalties
The largest common embeddable subtree problem asks for the largest possi...
research
∙
03/29/2018
A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
We propose a fixed-parameter tractable algorithm for the Max-Cut problem...
research
∙
02/16/2018
Recognizing Cuneiform Signs Using Graph Based Methods
The cuneiform script constitutes one of the earliest systems of writing ...
research
∙
03/02/2017
A Unifying View of Explicit and Implicit Feature Maps for Structured Data: Systematic Studies of Graph Kernels
Non-linear kernel methods can be approximated by fast linear ones using ...
research
∙
10/01/2016
Faster Kernels for Graphs with Continuous Attributes via Hashing
While state-of-the-art kernels for graphs with discrete labels scale wel...
research
∙
06/03/2016
