64 resultados para Common Cycles
Resumo:
Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
A geodesic in a graph G is a shortest path between two vertices of G. For a specific function e(n) of n, we define an almost geodesic cycle C in G to be a cycle in which for every two vertices u and v in C, the distance d(G)(u, v) is at least d(C)(u, v) - e(n). Let omega(n) be any function tending to infinity with n. We consider a random d-regular graph on n vertices. We show that almost all pairs of vertices belong to an almost geodesic cycle C with e(n)= log(d-1)log(d-1) n+omega(n) and vertical bar C vertical bar =2 log(d-1) n+O(omega(n)). Along the way, we obtain results on near-geodesic paths. We also give the limiting distribution of the number of geodesics between two random vertices in this random graph. (C) 2010 Wiley Periodicals, Inc. J Graph Theory 66: 115-136, 2011
Resumo:
Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
MgO based refractory castables draw wide technological interest because they have the versatility and installation advantages of monolithic refractories with intrinsic MgO properties, such as high refractoriness and resistance to basic slag corrosion. Nevertheless, MgO easily reacts with water to produce Mg(OH)(2), which is followed by a large volumetric expansion, limiting its application in refractory castables. In order to develop solutions to minimize this effect, a better understanding of the main variables involved in this reaction is required. In this work, the influence of temperature, as well as the impact of the chemical equilibrium shifting (known as the common-ion effect), on MgO hydration was evaluated. Ionic conductivity measurements at different temperatures showed that the MgO hydration reaction is accelerated with increasing temperature. Additionally, different compounds were added to evaluate their influence on the reaction rate. Among them, CaCl(2) delayed the reaction, whereas KOH showed an opposite behavior. MgCl(2) and MgSO(4) presented similar results and two other distinct effects, reaction delay and acceleration, which depended on their concentration in the suspensions. The results were evaluated by considering the kinetics and the thermodynamics of the reaction, and the mechanical damages in the samples that was caused by the hydration reaction. (C) 2009 Elsevier Ltd and Techna Group S.r.l. All rights reserved.