7661 search results - page 1479 / 1533 » Languages and the Computing Profession |
170
click to vote
ICALP
2009
Springer
16 years 4 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...
136
click to vote
ICALP
2009
Springer
16 years 4 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...
142
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
129
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
142
click to vote
ICALP
2009
Springer
16 years 4 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...