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

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

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

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