336 search results - page 2 / 68 » Improved data structures for fully dynamic biconnectivity |
COMPGEOM
2011
ACM
12 years 9 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
ICDM
2009
IEEE
14 years 13 days ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
SISAP
2009
IEEE
14 years 15 days ago
2009
IEEE
—We introduce a novel metric space search data structure called EGNAT, which is fully dynamic and designed for secondary memory. The EGNAT is based on Brin’s GNAT static index,...
IS
2011
13 years 22 days ago
2011
Metric access methods based on hyperplane partitioning have the advantage, compared to the ballpartitioning-based ones, that regions do not overlap. The price is less flexibility...
TALG
2008
13 years 5 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...