Information Processing Letters

• Complete characterization for cycle idealness in semicomplete digraphs.
• ...

A semicomplete digraph is a digraph obtained from a complete graph by orienting each edge either in one direction or both possible ways. In this paper, we present a necessary and sufficient condition in the form of forbidden minors for ...

• We introduce the concept of a cactus metric.
• A cactus metric is a ...

The problem of realizing finite metric spaces in terms of weighted graphs has many applications. For example, the mathematical and computational properties of metrics that can be realized by trees have been well-studied and such ...

• Variational networks of cube-connected cycles are new interconnection networks.

In this short note we show that the interconnection networks known as variational networks of cube-connected cycles form a sub-class of the recursive cubes of rings.

• Firstly, a basic TCSS scheme based on a bivariate polynomial is proposed to thwart illegal participant attack.

( t , n ) threshold secret sharing (SS) is an important cryptographic primitive in which a secret is divided into n shares, and then any t or more shareholders can exchange shares to reconstruct the secret without help ...

• We introduced a new generalization to constructions with quadratic residues for self-dual codes.

In this work we consider modified versions of quadratic double circulant and quadratic bordered double circulant constructions over the binary field and the rings F 2 + u F 2 and F 4 + u F 4 for different prime values of p. Using these ...