3415 search results - page 212 / 683 » Lower bounds on kernelization |
156
click to vote
JCT
1998
15 years 6 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...
131
click to vote
FSS
2010
15 years 4 months ago
2010
We study the relationship between multivariate quasi-copulas and measures that they may or may not induce on [0, 1]n. We first study the mass distribution of the pointwise best p...
164
Voted
PE
2010
Springer
15 years 4 months ago
2010
Springer
We analyze the capacity scaling laws of wireless networks where the spatial distribution of nodes over the network area exhibits a high degree of clustering. In particular we cons...
175
Voted
COCOA
2010
Springer
15 years 4 months ago
2010
Springer
We are searching for an unknown horizontal or vertical line in the plane under the competitive framework. We design a well-suited framework for all cylcic strategies that result in...
136
click to vote
NHM
2010
15 years 1 months ago
2010
We consider a so-called random obstacle model for the motion of a hypersurface through a field of random obstacles, driven by a constant driving field. The resulting semilinear par...