We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized time for each edge update where n is the number of vertices in the graph. While there is a trivial O(n) algorithm for edge update, the previous best known result for this problem was due to Ivković and Llyod[4]. For a g...

Quantum computations are typically performed as a sequence of basic operations, called quantum gates. Different gate sequences, circuits, can implement the same overall computation. Since every additional takes time and introduces noise into system, it is important to find smallest possible circuit that implements given computation, especially for near-term devices execute only limited number g...

We show that every cubic bridgeless graph with n vertices has at least 3n/4 − 10 perfect matchings. This is the first bound that differs by more than a constant from the maximal dimension of the perfect matching polytope.

In this paper, a new approach for Drug-Drug Interaction detection is presented. The proposed method consists in discovering patterns automatically through Maximal Frequent Sequences extraction and using pattern matching to identify sentences that contain Drug-Drug Interactions. Maximal Frequent Sequences define word sequences that are frequent in texts and it has been proved in this paper to be...

We present an anonymous self-stabilizing algorithm for finding a 1-maximal matching in trees, and rings of length not divisible by 3. We show that the algorithm converges in O(n) moves under an arbitrary central daemon.

Iowa State University 1.1 Basic Definitions and Properties . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Linear Time Construction Algorithms . . . . . . . . . . . . . 1-4 Suffix Trees vs. Suffix Arrays • Linear Time Construction of Suffix Trees • Linear Time Construction of Suffix Arrays • Space Issues 1.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Stable matching problems have several practical applications. If preference lists are truncated and contain ties, finding a stable matching with maximal size is computationally difficult. We address this problem using a local search technique, based on Adaptive Search and present experimental evidence that this approach is much more efficient than state-of-the-art exact and approximate methods....

Abstract In this paper, we deal with minimum cost b -matching problems on graphs where the nodes are assumed to belong non-necessarily convex regions called neighborhoods, and costs given by distances between points of neighborhoods. The goal in proposed is twofold: (i) finding a graph (ii) determining point each neighborhood be connection among edges defining b-matching. Different variants pro...

For a graph property P, we define a P-matching as a set M of disjoint edges such that the subgraph induced by the vertices incident to M has property P. Previous examples include strong/induced matchings and uniquely restricted matchings. We explore the general properties of P-matchings, but especially the cases where P is the property of being acyclic or the property of being disconnected. We ...