In this paper, we consider the problem of finding a maximum weight 2-matching containing no cycle of length at most three in a weighted simple graph, which we call the weighted trianglefree 2-matching problem. Although the polynomial solvability of this problem is still open in general graphs, a polynomial-time algorithm is given by Hartvigsen and Li for the problem in subcubic graphs, i.e., gr...

In this paper, we study distributed algorithms to compute a weighted matching that have constant (or at least sub-logarithmic) running time and that achieve approximation ratio 2 + ǫ or better. In fact we present two such synchronous algorithms, that work on arbitrary weighted trees. The first algorithm is a randomised distributed algorithm that computes a weighted matching of an arbitrary weig...

A work-eecient deterministic NC algorithm is presented for nding a maximum matching in a bipartite expander graph with any expansion factor > 1. This improves upon a recently presented deterministic NC maximum matching algorithm which is restricted to those bipartite expanders with large expansion factors (; > 0), and is not work-eecient 1].

ontology is the main infrastructure of the semantic web which provides facilities for integration, searching and sharing of information on the web. development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. by emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-vertices induce a 1-regular subgraph. An induced matching M is maximal if no other induced matching contains M . The MINIMUM MAXIMAL INDUCED MATCHING problem asks for a minimum maximal induced matching in a given graph. The problem is known to be NP-complete. Here we show that, if P 6= NP, for any ε >...

The following class of matching problems is considered. The vertices of a complete und~res-This class of weighted graphs is applicable to scheduhng and optimal assignment problems. A maximum weighted (perfect) matching is found in O(n. log n) operations. 1. Introduction. The maximum matching problem has many applications in operations research. The first polynomial-time bounded algorithm for th...

We present a polylogarithmic local computation matching algorithm which guarantees a (1−ǫ)-approximation to the maximum matching in graphs of bounded degree.

This paper presents the 3-D terrain reconstruction with aerial photography. The results of 3-D reconstruction using intensity-based matching and hybrid intensity-based and epipolar geometry approach matching are shown and compared. The intensity-based image matching uses maximum normalized cross correlation to find the displacement vector between two images. This method can overcome the effect ...

Matching is an extensively studied topic. The question we want to study here is the lower bound of a maximum matching in a graph. Earlier researchers studied the problem of the existence of a perfect matching (i.e. a matching of size n/2 with n vertices in a graph). Petersen [7] showed that a bridgeless cubic graph has a perfect matching. König [4] showed that there exists a perfect matching in...