ESA
1994
Springer
14 years 3 months ago
1994
Springer
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
ESA
1994
Springer
14 years 3 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
FODO
1993
Springer
14 years 3 months ago
1993
Springer
FODO
1993
Springer
14 years 3 months ago
1993
Springer
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
FODO
1993
Springer
14 years 3 months ago
1993
Springer
Abstract. Data storage systems are being called on to manage continuous media data types, such as digital audio and video. There is a demand by applications for \constrained-latenc...
FODO
1993
Springer
14 years 3 months ago
1993
Springer
Abstract–Multimedia computing requires support for heterogeneous data types with differing storage, communication and delivery requirements. Continuous media data types such as ...
ESA
1993
Springer
14 years 3 months ago
1993
Springer
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
ESA
1993
Springer
14 years 3 months ago
1993
Springer
ESA
1993
Springer
14 years 3 months ago
1993
Springer
A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction. Testing upward planarity and constructing upward ...
ESA
1993
Springer
14 years 3 months ago
1993
Springer