389 citations · 1.1k across the 26 of their papers we have counts for
4 papers · 1 filter
A general purpose algorithm for counting simple cycles and simple paths of any length
Pierre-Louis Giscard, Nils Kriege, Richard C. Wilson
We describe a general purpose algorithm for counting simple cycles and simple paths of any length on a (weighted di)graph on vertices and edges, achieving a time com…
Finding Largest Common Substructures of Molecules in Quadratic Time
Andre Droschinsky, Nils Kriege, Petra Mutzel
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Henc…
Faster Kernels for Graphs with Continuous Attributes via Hashing
Christopher Morris, Nils M. Kriege, Kristian Kersting +1
While state-of-the-art kernels for graphs with discrete labels scale well to graphs with thousands of nodes, the few existing kernels for graphs with continuous attributes, unfortu…
On Valid Optimal Assignment Kernels and Applications to Graph Classification
Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson
The success of kernel methods has initiated the design of novel positive semidefinite functions, in particular for structured data. A leading design paradigm for this is the convol…