3208 search results - page 121 / 642 » A Lower Bound for Primality |
172
click to vote
DAM
2008
15 years 6 months ago
2008
This paper presents algorithms to find vertex-critical and edgecritical subgraphs in a given graph G, and demonstrates how these critical subgraphs can be used to determine the ch...
162
click to vote
IPL
2010
15 years 4 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
181
click to vote
EJC
2011
15 years 1 months ago
2011
Henning and Yeo proved a lower bound for the minimum size of a maximum matching in a connected k-regular graphs with n vertices; it is sharp infinitely often. In an earlier paper...
135
click to vote
ECCV
2002
Springer
16 years 8 months ago
2002
Springer
Estimating the parameters of a pencil of lines is addressed. A statistical model for the measurements is developed, from which the Cramer Rao lower bound is determined. An estimato...
153
click to vote
ADCM
2008
15 years 5 months ago
2008
We derive upper and lower bounds on the dimensions of trivariate spline spaces defined on tetrahedral partitions. The results hold for general partitions, and for all degrees of sm...