ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
Abstract. In this paper we address the problem of estimating the number of stations in a wireless network. Under the assumption that each station can detect collisions, we show tha...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
Given a set S of n points in RD , and an integer k such that 0 k < n, we show that a geometric graph with vertex set S, at most n − 1 + k edges, maximum degree five, and dila...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
This paper presents the SkipTree, a new balanced, distributed data structure for storing data with multidimensional keys in a peer-topeer network. The SkipTree supports range quer...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
ISAAC
2005
Springer
13 years 9 months ago
2005
Springer
This paper addresses geometric problems that concern manufacturing an object using a cast with a core. In casting, molten material is poured into the cavity of the cast and allowe...