In this paper, we propose new pipelined request-grant-accept (RGA) and request-grant (RG) maximal size matching (MSM) algorithms to achieve speedup in combined input and output queueing (CIOQ) switches. To achieve a speedup factor , in the proposed pipelined RGA/RG MSM algorithms, we pipeline operations of finding matchings in scheduling cycles based on the observation that all matched inputs/o...

Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple replicator dynamics from evolutionary game theory. Experiments on hundreds of uniformly...

We look at the minimal size of a maximal matching in general, bipartite and d-regular random graphs. We prove that the ratio between the sizes of any two maximal matchings approaches one in dense random graphs and random bipartite graphs. Weaker bounds hold for sparse random graphs and random dregular graphs. We also describe an algorithm that with high probability finds a matching of size stri...

Let be the random graph with fixed p 1. A strong matching S in Gn,p is a set of {el, e2, ... I em} such that no other of the connects an end-vertex of with an end-vertex of ej, ei ej. We show in this paper, that there exist positive constants Cl and C2 such that, with probability tending to 1 as n --+ 00, the minimum size of a maximal strong in Gn,p lies between 1/21ogdn c1logd1ogdn and logdn +...

In this paper, we provide polynomial-time algorithms for different extensions of the matching counting problem, namely maximal matchings, path matchings (linear forest) and paths, on graph classes of bounded clique-width. For maximal matchings, we introduce matchingcover pairs to efficiently handle maximality in the local structure, and develop a polynomial time algorithm. For path matchings, w...

Introduction: Tinnitus is one of the complex symptoms of hearing described as a phantom auditory sensation without any external stimulation. Due to the subjective nature of tinnitus, perception and discomfort of tinnitus vary among the patients. The main aim of this study is to investigate the effects of gender, age and the degree of hearing loss on discomfort due to tinnitus.  Methods: E...

A number of morphological shape representation algorithms have been proposed over the years. However, not many shape matching algorithms have been developed based on these representation algorithms. In this paper, we present a structural shape matching algorithm that uses both internal and external shape components selected from the maximal disks determined by a traditional and a generalized mo...

For a bipartite graph G = (V, E), (1) perfect, (2) maximum and (3) maximal matchings are matchings (1) such that all vertices are incident to some matching edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are O(|V |) per ...

We present a distributed approximation algorithm that computes in every graph G a matching M of size at least 2 3 β(G), where β(G) is the size of a maximum matching in G. The algorithm runs in O(log |V (G)|) rounds in the synchronous, message passing model of computation and matches the best known asymptotic complexity for computing a maximal matching in the same protocol. This improves the run...

We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any p ≤ |M | p edges whose total weight is at least 1 √ 2 of the maximum weight of a p-matching. We use this property to approximate the metric maximum clustering problem with given cluster sizes.