Sciweavers

ISAAC
1998
Springer
153views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems
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...
Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang
ISAAC
1998
Springer
94views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Two-Layer Planarization in Graph Drawing
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...
Petra Mutzel, René Weiskircher
ISAAC
1998
Springer
71views Algorithms» more  ISAAC 1998»
14 years 3 months ago
K-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibar...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
14 years 3 months ago
On the Multiple Gene Duplication Problem
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...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 3 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
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...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
ISAAC
1998
Springer
88views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Dynamic Grid Embedding with Few Bends and Changes
Ulrik Brandes, Dorothea Wagner
ISAAC
1998
Springer
81views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Visibility Queries in Simple Polygons and Applications
Abstract. In this paper we explore some novel aspects of visibility for stationary and moving points inside a simple polygon
Boris Aronov, Leonidas J. Guibas, Marek Teichmann,...
ISAAC
1998
Springer
90views Algorithms» more  ISAAC 1998»
14 years 3 months ago
Generalized Self-Approaching Curves
Abstract. We consider all planar oriented curves that have the following property depending on a fixed angle . For each point B on the curve, the rest of the curve lies inside a we...
Oswin Aichholzer, Franz Aurenhammer, Christian Ick...