SODA
2000
ACM
13 years 6 months ago
2000
ACM
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We describe a new external memory data structure, the buffered repository tree, and use it to provide the first non-trivial external memory algorithm for directed breadth-first se...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
This presentation covers several sections of the paper by Berkman, Parnas and Sgall for the Advanced Topics in Network Security seminar. Ben-Gurion University of the Negev, fall 2...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...