K
Kurt Mehlhorn
Researcher at Max Planck Society
Publications - 605
Citations - 22903
Kurt Mehlhorn is an academic researcher from Max Planck Society. The author has contributed to research in topics: Data structure & Time complexity. The author has an hindex of 71, co-authored 599 publications receiving 21548 citations. Previous affiliations of Kurt Mehlhorn include Humboldt University of Berlin & University of Illinois at Urbana–Champaign.
Papers
More filters
Journal ArticleDOI
Weisfeiler-Lehman Graph Kernels
TL;DR: A family of efficient kernels for large graphs with discrete node labels based on the Weisfeiler-Lehman test of isomorphism on graphs that outperform state-of-the-art graph kernels on several graph classification benchmark data sets in terms of accuracy and runtime.
Book
LEDA: A Platform for Combinatorial and Geometric Computing
Kurt Mehlhorn,Stefan Näher +1 more
TL;DR: There is no standard library of the data structures and algorithms of combinatorial and geometric computing as discussed by the authors, which is in sharp contrast to many other areas of computing, such as discrete optimization, scheduling, traffic control, CAD, and graphics.
Proceedings Article
Efficient Graphlet Kernels for Large Graph Comparison
TL;DR: In this article, two theoretically grounded speedup schemes are introduced, one based on sampling and the second specifically designed for bounded degree graphs, to efficiently compare large graphs that cannot be tackled by existing graph kernels.
Book
Faster Algorithms for the Shortest Path Problem
TL;DR: Efficient implementations of Dijkstra's shortest path algorithm are investigated and a new data structure, called the radix heap, is proposed for use in this algorithm.
Book ChapterDOI
The LEDA Platform of Combinatorial and Geometric Computing
TL;DR: An overview of the LEDA platform for combinatorial and geometric computing and an account of its development are given and some recent theoretical developments are discussed.