The advancement of large scale integrated circuit technology has enabled the construction
of complex interconnection networks. Graph theory provides a fundamental tool for …

An accurate and safe estimation of a task's worst case execution time (WCET) is crucial for
reasoning about the timing properties of real time systems. In RISC processors, the …

A procedure called SVM-KM, based on clustering by k-means and to accelerate the training
of support vector machines, is the main objective of the work. During the support vector …

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining
k distinct source-sink pairs in which each vertex of G is covered by a path. We deal with the …

To find a cycle (resp. path) of a given length in a graph is the cycle (resp. path) embedding
problem. To find cycles of all lengths from its girth to its order in a graph is the pancyclic …

The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube
has only about half diameter, wide diameter, and fault diameter of those of the n …

The arrangement graph A/sub n, k/is a generalization of the star graph. There are some
results concerning fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement …

The connectivity is an important measurement for the fault-tolerance of networks. The
structure connectivity and substructure connectivity are two generalizations of the classical …

The ℓ-component connectivity (or ℓ-connectivity for short) of a graph G, denoted by κ ℓ (G), is
the minimum number of vertices whose removal from G results in a disconnected graph with …

The diagnosis of faulty processors plays an important role in multiprocessor systems for
reliable computing, and the diagnosability of many well-known networks has been explored …