3471 search results - page 267 / 695 » Obstacle Numbers of Graphs |
174
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
`Approximate message passing' algorithms proved to be extremely effective in reconstructing sparse signals from a small number of incoherent linear measurements. Extensive num...
148
click to vote
IPL
2006
15 years 6 months ago
2006
Many real networks, including those in social, technological, and biological realms, are small-world networks. The two distinguishing characteristics of small-world networks are h...
145
click to vote
EJC
2007
15 years 6 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
157
click to vote
JCT
2007
15 years 6 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...