9 search results - page 1 / 2 » A randomized O(m log m) time algorithm for computing Reeb gr... |
COMPGEOM
2010
ACM
14 years 14 days ago
2010
ACM
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
SIAMDM
2010
13 years 2 months ago
2010
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...