K. Mehlhorn

Publications547
h-index65
Citations17,571
Highly Influential Citations1,062
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • R. Tarjan
  • 421 Publications, 62,322 Citations
  • Michael Sagraloff
  • 54 Publications, 852 Citations
  • S. Näher
  • 69 Publications, 3,318 Citations
  • V. Vazirani
  • 248 Publications, 17,200 Citations
  • Publications
  • Influence
Weisfeiler-Lehman Graph Kernels
TLDR
We propose a rapid feature extraction scheme based on the Weisfeiler-Lehman test of isomorphism on graphs. Expand
  • 872
  • 158
  • PDF
LEDA: a platform for combinatorial and geometric computing
TLDR
There is no standard library of the data structures and algorithms of combinatorial and geometric computing. Expand
  • 1,299
  • 108
  • PDF
Efficient graphlet kernels for large graph comparison
TLDR
We propose to compare graphs by counting graphlets, i.e., subgraphs with k nodes where k ∈ {3, 4, 5}. Expand
  • 608
  • 77
  • PDF
Faster algorithms for the shortest path problem
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the <italic>radix heap</italic>, is proposed for use in this algorithm. On a network… Expand
  • 497
  • 23
  • PDF
The LEDA Platform of Combinatorial and Geometric Computing
TLDR
We give an overview of the LEDA platform for combinatorial and geometric computing and an account of its development. Expand
  • 411
  • 22
  • PDF
A Faster Approximation Algorithm for the Steiner Problem in Graphs
  • K. Mehlhorn
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 25 March 1988
TLDR
We present a new implementation of the Kou, Markowsky and Berman algorithm for finding a Steiner tree for connected, undirected distance graph with a specified subset S of the set of vertices V . Expand
  • 330
  • 19
A Parallelization of Dijkstra's Shortest Path Algorithm
TLDR
The single source shortest path (SSSP) problem lacks parallel solutions which are fast and simultaneously work-efficient. Expand
  • 167
  • 19
Popular matchings
TLDR
In this paper, we give the first polynomial-time algorithms to determine if an instance admits a popular matching, and to find a largest such matching, if one exists, and show that the problem has equivalent time complexity to the maximum-cardinality bipartite matching problem. Expand
  • 112
  • 18
  • PDF
Data Structures and Algorithms 1: Sorting and Searching
  • K. Mehlhorn
  • Computer Science
  • EATCS Monographs on Theoretical Computer Science
  • 8 December 2011
  • 456
  • 15
Congruence, similarity, and symmetries of geometric objects
TLDR
We consider the problem of computing geometric transformations (rotation, translation, reflexion) that map a point setA exactly or approximately into a pointSet B, and derive efficient algorithms for various cases. Expand
  • 205
  • 14