BACKGROUND Radial movement of the arterial wall is a well-known indicator of the mechanical properties of arteries in arterial disease examinations. In the present study, two different motion estimation methods, based on the block-matching and maximum-gradient algorithms, were examined to extract the radial displacement of the carotid artery wall. METHODS Each program was separately implement...

Given a graph G = (V; E) and a real weight for each vertex of G, the vertex-weight of a matching is deened to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for nding a maximum vertex-weighted matching in a strongly chordal graph, given a strong elimination ordering. The algorithm can be specialized to nd a maximum cardinality...

ÐThis paper investigates the influence of the cost function on the optimal match between two graphs. It is shown that, for a given cost function, there are an infinite number of other cost functions that lead, for any given pair of graphs, to the same optimal error correcting matching. Furthermore, it is shown that well-known concepts from graph theory, such as graph isomorphism, subgraph isomo...

For a graph G let L(G) and l(G) denote the size of the largest and smallest maximum matching of a graph obtained from G by removing a maximum matching of G. We show that L(G) ≤ 2l(G), and L(G) ≤ 3 2 l(G) provided that G contains a perfect matching. We also characterize the class of graphs for with L(G) = 2l(G). Our characterization implies the existence of a polynomial algorithm for testing the...

Recent advances in computer vision, information retrieval, and molecular biology amply demonstrate the value and importance of graph matching. However, graph matching algorithms developed to date are either application domainspecific or severely limited by the problem size. This paper presents a unified solution for the broad range of major graph matching problems. Particularly, the new algorit...

A matching in a graph is a set of edges no two of which share a common vertex. A matching M is an induced matching if no edge connects two edges of M. The problem of finding a maximum induced matching is known to be NP-hard in general and specifically for bipartite graphs. Lozin has been proposed an O(n) time algorithm for this problem on the class of bipartite Star123, Sun4-free graphs. In thi...

A sparse subgraph G′ of G is called a matching sparsifier if the size or weight of matching in G′ is approximately equal to the size or weight of maximum matching in G. Recently, algorithms have been developed to find matching sparsifiers in a static bipartite graph. In this paper, we show that we can find matching sparsifier even in an incremental bipartite graph. This observation leads to fol...