23 search results - page 5 / 5 » Improved Induced Matchings in Sparse Graphs |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ICALP
2010
Springer
14 years 8 days ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The matching and retrieval of 2D shapes is an important
challenge in computer vision. A large number of shape
similarity approaches have been developed, with the main
focus bein...