Sciweavers

56 search results - page 4 / 12
» The RW2 Algorithm for Exact Graph Matching
Sort
View
DC
2011
13 years 11 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
PPAM
2007
Springer
15 years 5 months ago
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
Fredrik Manne, Rob H. Bisseling
JEI
2006
82views more  JEI 2006»
14 years 11 months ago
Real-time mosaic using sequential graph
To prevent large error accumulation in multiple image registration considering real-time applications, we propose a new fast global mosaic method using sequential block matching in...
Dae Woong Kim, Ki-Sang Hong
DAM
2002
135views more  DAM 2002»
14 years 11 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
CSCLP
2007
Springer
15 years 5 months ago
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
Yves Deville, Grégoire Dooms, Stépha...