154 search results - page 25 / 31 » algorithmica 2007 |
116
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
119
click to vote
ALGORITHMICA
1998
14 years 11 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
ALGORITHMICA
1998
14 years 11 months ago
1998
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
ALGORITHMICA
1999
14 years 11 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...
110
click to vote
ALGORITHMICA
1999
14 years 11 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...