SWAT
1998
Springer
14 years 10 months ago
1998
Springer
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
LATIN
1998
Springer
14 years 10 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
ISCOPE
1998
Springer
14 years 10 months ago
1998
Springer
The multiple minimum degree (MMD) algorithm and its variants have enjoyed 20+ years of research and progress in generating ll-reducing orderings for sparse, symmetric positive de n...
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
ISAAC
1998
Springer
14 years 10 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...