35 search results - page 4 / 7 » Maximum Matchings in Regular Graphs of High Girth |
JGAA
2007
13 years 8 months ago
2007
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
ICCAD
2003
IEEE
14 years 5 months ago
2003
IEEE
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...