389 citations · 1.1k across the 26 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Nils Kriege, Florian Kurpicz, Petra Mutzel
The complexity of the maximum common connected subgraph problem in partial -trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplan…
cs.LG2017★ 16 cited
A Unifying View of Explicit and Implicit Feature Maps of Graph Kernels
Nils M. Kriege, Marion Neumann, Christopher Morris +2
Non-linear kernel methods can be approximated by fast linear ones using suitable explicit feature maps allowing their application to large scale problems. We investigate how convol…