The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...

Uncertain graphs are employed to describe graph models with indeterministicinformation that produced by human beings. This paper aims to study themaximum matching problem in uncertain graphs.The number of edges of a maximum matching in a graph is called matching numberof the graph. Due to the existence of uncertain edges, the matching number of an uncertain graph is essentially an uncertain var...

Sending compressed video data in error-prone environments (like the Internet and wireless networks) might cause data degradation. Error concealment techniques try to conceal the received data in the decoder side. In this paper, an adaptive boundary matching algorithm is presented for recovering the damaged motion vectors (MVs). This algorithm uses an outer boundary matching or directional tempo...

We attempt to analyze and adopt the interference of monoclonal antibody cluster differentiation 38 on ABO blood group identification cross-matching. Search PubMed, Medline, Web Science, China National Knowledge Infrastructure, Wanfang other domestic foreign databases, screening patients requiring transfusion after receiving anti-cluster antibody, retrospective analysis anti-human globulin casse...

employment agencies have gained an increasing significance in matching employment and vacancies in the economy. solo searches by workers, and shorterperiods of employment, have necessarilyadded to the need for third party agents for the matching process in labour markets. thus the existence of these agents and sole agent searches has created a multiplicity of wages across labour . markets. we d...

it is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (castelnuovo-mumford) regularity. as a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph g are equal provided g is well-covered bipa...

Using large-scale administrative data from Hungary, we examine the effects of attending a high-poverty school in Grade 8 on academic achievement and later educational attainment, using matching approach. We find that is negatively associated with reading scores secondary education while there no significant association math scores. Estimates are negative case higher enrollment, but their statis...

An algorithm is suggested for implementation of unlimited primaries in two-constants Kubelka-Munk color matching attempt. Allen's method for tristimulus color matching which was limited to four colorants in two constant theory, dealt with inversable matrices. By application of the pseudo-inverse, it is not necessary to limit the number of primary colors to four as Allen suggested. The suggested...