17185 search results - page 3243 / 3437 » Computational and Quantitative Studies |
218
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
183
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
177
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
273
click to vote
ICALP
2009
Springer
16 years 7 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
284
click to vote
VLDB
2008
ACM
16 years 6 months ago
2008
ACM
With the development of inexpensive storage devices, space usage is no longer a bottleneck for computer users. However, the increasingly large amount of personal information poses ...