1732 search results - page 91 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
153
click to vote
STACS
2007
Springer
16 years 15 days ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
176
click to vote
RSA
2010
15 years 4 months ago
2010
In this paper we analyze the appearance of a Hamilton cycle in the following random process. The process starts with an empty graph on n labeled vertices. At each round we are pre...
169
click to vote
MST
2006
15 years 6 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
189
click to vote
IPL
2007
15 years 6 months ago
2007
Computing a suitable measure of consensus among several clusterings on the same data is an important problem that arises in several areas such as computational biology and data mi...
175
click to vote
MSWIM
2004
ACM
15 years 12 months ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...