|We develop new statistical techniques for delay fault analysis. True value simulation is performed using a multi-value logic system describing signal states of two consecutive vectors. Signal statistics are used to estimate transition probabilities and observabilities. These allow us to estimate detection probabilities and the coverage for transition faults. For path delay faults, recognizing ...

The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a string into a compact data structure that supports fast LCE queries. In this paper we generalize the LCE problem to trees and suggest a few applications of LCE in trees to tries and XML databases. Given a labeled and ...

A digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete n-partite digraph. We call (D)=max16 i6 n{|Vi|} the independence number of the semicomplete n-partite digraph D, where V1; V2; : : : ; Vn are the partite sets of D. Let p and c, respectively, denote the number of vertices in a longest directed path and t...

We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable path (in particular, every longest path). The classes are the arclocal tournament, quasi-transitive, locally in-semicomplete (out-semicomplete), and semicomplete k-partite digraphs. We present results on strongly intern...

In this work we give efficient molecular computing solutions to eight well-known NP-complete problems, namely the Hamiltonian circuit, Longest path, Longest circuit, Path with forbidden pairs, Monochromatic triangle, Partition into triangles, Partition into paths of length two and Circuit satisfiability problems in the Parallel filtering model of Amos et al. We also show that this model can be ...

The Snake-in-the-Box problem is that of finding a longest induced path in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {11, 12, 13}. The Coil-in-the-Box problem is that of finding a longest induced cycle in an n-dimensional hypercube. We prove new lower bounds for the values n ∈ {12, 13}.

Let G be a K 1;r-free graph (r 3) on n vertices. We prove that, for any induced path or induced cycle on k vertices in G (k 2r ? 1 or k 2r, respectively), the degree sum of its vertices is at most (2r ? 2)(n ?) where is the independence number of G. As a corollary we obtain an upper bound on the length of a longest induced path and a longest induced cycle in a K 1;r-free graph. Stronger bounds ...