SODA
2001
ACM
13 years 11 months ago
2001
ACM
Many massive graphs (such as the WWW graph and Call graphs) share certain universal characteristics which can be described by so-called the "power law". Here we determin...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
SODA
2001
ACM
13 years 11 months ago
2001
ACM
Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...