64 search results - page 8 / 13 » Approximability of Edge Matching Puzzles |
DAM
2011
14 years 6 months ago
2011
We present a collection of new structural, algorithmic, and complexity results for two types of matching problems. The first problem involves the computation of k-maximal matchin...
84
Voted
ICIP
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
87
Voted
PVLDB
2010
14 years 10 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
110
click to vote
ISAAC
2007
Springer
15 years 5 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
SODA
2004
ACM
15 years 1 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...