Mehlhorn K.

K. Mehlhorn

Information about the author K. Mehlhorn will soon be added to the site.
Found 5 papers in total
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
A heuristic for Dijkstra's algorithm with many targets and its use in weighted matching algorithms
2003
We consider the single-source many-targets shortest-path (SSMTSP) problem in directed...
Lower bounds for set intersection queries
Lower bounds for set intersection queries
1995
We consider the following set intersection reporting problem. We have a collection of...
Algorithms for dense graphs and networks on random-access computers
Algorithms for dense graphs and networks on random-access computers
1996
We improve upon the running time of several graph and network algorithms when applied...
An O(n3/log(n))-time maximum-flow algorithm
An O(n3/log(n))-time maximum-flow algorithm
1996
We show that a maximum flow in a network with n vertices can be computed...
On the all-pairs shortest-path algorithm of Moffat and Takaoka
On the all-pairs shortest-path algorithm of Moffat and Takaoka
1997
We review how to solve the all-pairs shortest-path problem in a nonnegatively weighted...
Papers per page: