11784 search results - page 391 / 2357 » Interpolation for data structures |
172
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
185
click to vote
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
167
click to vote
ICSE
1999
IEEE-ACM
15 years 11 months ago
1999
IEEE-ACM
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
196
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
147
click to vote
CGF
2002
15 years 6 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...