An elementary example of matching theory is the following puzzle (popularized by R. Gomory). Given a standard 8× 8 chessboard, can it always be covered by dominoes (a piece consisting of two squares) if one arbitrary black square and one arbitrary white square are deleted? The solution is given in the exercises. Another puzzle which involves the idea of matchings is the following Putnam problem...

Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of G. Let k(x, y) be log x/ log(x/y). We present a new decomposition theorem for maximum weight bipartite matchings and use it to design an O( √ nW/k(n,W/N))-time algorithm for computing a maximum weight matching of G. T...

The paper has established and veri ed the theory prevailing widely among image and pattern recognition specialists that the bottom-up indirect regional matching process is the more stable and the more robust than the global matching process against concentrated types of noise represented by clutter, outlier or occlusion in the imagery. We have demonstrated this by analyzing the e ect of concent...

Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = ⌊ k + 2 k + 1 n ⌋ − (k + 1) matchings M1, . . . ,MN , each of size n. We show that G has a rainbow matching of size n− k, i.e. a matching of size n− k with all edges coming from different Mi’s. Several choices of parameters relate to known results and conjectures. Suppose that a multigraph G is given with ...

Mining for Uncertain Trajectories Xu Ming1 Du Yi-man2 Wu Jian-ping2 Yang Zhou2 (School of Computer Science, Beijing University of Posts and Telecommunications, Beijing, 100876, china) 2 (School of Civil Engineering, Tsinghua University, Beijing, 100084, china) Abstract: In order to improve offline map matching accuracy of low-sampling-rate GPS, a map matching algorithm based on conditional rand...

this paper gives a short survey of some of the known results generalizing the theorem, credited to i. schur, that if the central factor group is finite then the derived subgroup is also finite.

In this paper, we study matching integral graphs of small order. A graph is called matching integral if the zeros of its matching polynomial are all integers. Matching integral graphs were first studied by Akbari, Khalashi, etc. They characterized all traceable graphs which are matching integral. They studied matching integral regular graphs. Furthermore, it has been shown that there is no matc...

The present paper is to honour Gyula Katona, my teacher on the occasion of his 80th birthday. Its main content threefold, new proofs old results (e.g. De Bonis, Swanepoel Theorem butterfly-free families), obtained via Katona Circle for sum sizes non-empty cross-intersecting solution some notoriously difficult problems Erdős Matching Conjecture).

schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...

Let S be a set of linear inequalities that determine a bounded polyhedron P. The closure of S is the smallest set of inequalities that contains S and is closed under two operations: (i) taking linear combinations of inequalities, (ii) replacing an inequality c aj xj 2 ao, where al, a2, . . . , an are integers, by the inequality c a. x < a with a 1 [a,]. Obviously, if J jintegers Xl' 5’ l *a 9 ⌧...