It is well known that the problem of matching two relational structures can be posed as an equivalent problem of nding a maximal clique in a (derived) \association graph." However, it is not clear how to apply this approach to computer vision problems where the graphs are hierarchically organized, i.e. are trees, since maximal cliques are not constrained to preserve the partial order. Here we p...

Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a rank-maximal matching is one in which the maximum number of applicants is matched to their rank one posts and subject to this condition, the maximum number of applicants is matched to their rank two posts, and so on. A rank-maximal matching ca...

Let G(V, E) be an undirected graph. A set M ~ E is a matching if no two edges of M have a common vertex. The matching M is maximal if it is not properly contained in any other matching. Note that this does not necessarily imply that M has more edges than any other matching. A maximal matching can be found sequentially by the following greedy algorithm: Start with an empty matching and add any e...

Abstract. Two main performance features of high-bandwidth switches are stability and delay. This paper investigates these performance features for input buffered switch architectures that deploy maximal weight matching algorithms to determine the configurations of the switching core. For this purpose, a novel mathematical model of the dynamics of a maximal weight matching algorithm is developed...

the rings considered in this article are commutative with identity $1neq 0$. by a proper ideal of a ring $r$,  we mean an ideal $i$ of $r$ such that $ineq r$.  we say that a proper ideal $i$ of a ring $r$ is a  maximal non-prime ideal if $i$ is not a prime ideal of $r$ but any proper ideal $a$ of $r$ with $ isubseteq a$ and $ineq a$ is a prime ideal. that is, among all the proper ideals of $r$,...

This paper proposes an innovative Pipelinebased Maximal-sized Matching scheduling approach, called PMM, for input-bu ered switches. It dramatically relaxes the limitation of a single time slot for completing a maximal matching into any number of time slots. In the PMM approach, arbitration is operated in a pipelined manner, where K subschedulers are used. Each subscheduler is allowed to take mo...

We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n √ m + n log n), finding a maximal non-bipartite matching in time O(n( √ m/n+ log n) log n), and finding a maximal flow in an integer network in time O(min(n √ m · U, √ nUm) log n), where n is the number of vertices, m is the number of edges, and U ≤ n is an upper bound on the capacit...

ÐIt is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) aassociation graph.o However, it is not clear how to apply this approach to computer vision problems where the graphs are hierarchically organized, i.e., are trees, since maximal cliques are not constrained to preserve the partial order. Here,...