๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An all-round sweep algorithm for 2-dimensional nearest-neighbor problems

โœ Scribed by Klaus Hinrichs; Jurg Nievergelt; Peter Schorn

Book ID
105106504
Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
597 KB
Volume
29
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A simpleO(n2) algorithm for the all-pair
A simpleO(n2) algorithm for the all-pairs shortest path problem on an interval graph
โœ Mirchandani, Prakash ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 288 KB ๐Ÿ‘ 3 views

Let G denote an interval graph with n vertices and unit weight edges. In this paper, we present a simple O(n') algorithm for solving the all-pairs shortest path problem on graph G . A recent algorithm for this problem has the same time-complexity but is fairly complicated to describe. However, our a