2214 search results - page 361 / 443 » complexity 2004 |
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
SPLC
2004
13 years 11 months ago
2004
A fundamental reason for investing in product families is to minimize the application engineering costs. Several organizations that employ product families, however, are becoming i...