3204 search results - page 269 / 641 » The Alcuin Number of a Graph |
204
click to vote
IWCMC
2010
ACM
15 years 11 months ago
2010
ACM
—Analysis and modeling of wireless networks greatly depend on understanding the structure of underlying mobile nodes. In this paper we present two clustering algorithms to determ...
154
click to vote
POPL
2000
ACM
15 years 11 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
160
click to vote
MST
2010
15 years 5 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
152
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
187
click to vote
JCT
2007
15 years 6 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...