Page 1

Displaying 1 – 12 of 12

Showing per page

On 𝖿 -wise arc forwarding index and wavelength allocations in faulty all-optical hypercubes

Ján Maňuch, Ladislav Stacho (2003)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of f + 1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r -dimensional hypercube, where 0 f < r . This system of dipaths constitutes a routing protocol that remains functional in the presence of up to f faults (of nodes and/or links). The problem of constructing such protocols for general...

On the distribution of characteristic parameters of words

Arturo Carpi, Aldo de Luca (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

For any finite word w on a finite alphabet, we consider the basic parameters R w and K w of w defined as follows: R w is the minimal natural number for which w has no right special factor of length R w and K w is the minimal natural number for which w has no repeated suffix of length K w . In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.

On the distribution of characteristic parameters of words

Arturo Carpi, Aldo de Luca (2010)

RAIRO - Theoretical Informatics and Applications

For any finite word w on a finite alphabet, we consider the basic parameters Rw and Kw of w defined as follows: Rw is the minimal natural number for which w has no right special factor of length Rw and Kw is the minimal natural number for which w has no repeated suffix of length Kw. In this paper we study the distributions of these parameters, here called characteristic parameters, among the words of each length on a fixed alphabet.

On the distribution of characteristic parameters of words II

Arturo Carpi, Aldo de Luca (2002)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

The characteristic parameters K w and R w of a word w over a finite alphabet are defined as follows: K w is the minimal natural number such that w has no repeated suffix of length K w and R w is the minimal natural number such that w has no right special factor of length R w . In a previous paper, published on this journal, we have studied the distributions of these parameters, as well as the distribution of the maximal length of a repetition, among the words of each length on a given alphabet. In this paper...

On the distribution of characteristic parameters of words II

Arturo Carpi, Aldo de Luca (2010)

RAIRO - Theoretical Informatics and Applications

The characteristic parameters Kw and Rw of a word w over a finite alphabet are defined as follows: Kw is the minimal natural number such that w has no repeated suffix of length Kw and Rw is the minimal natural number such that w has no right special factor of length Rw. In a previous paper, published on this journal, we have studied the distributions of these parameters, as well as the distribution of the maximal length of a repetition, among the words of each length on a given alphabet....

On ƒ-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes

Ján Maňuch, Ladislav Stacho (2010)

RAIRO - Theoretical Informatics and Applications

Motivated by the wavelength division multiplexing in all-optical networks, we consider the problem of finding an optimal (with respect to the least possible number of wavelengths) set of ƒ+1 internally node disjoint dipaths connecting all pairs of distinct nodes in the binary r-dimensional hypercube, where 0 ≤ ƒ < r. This system of dipaths constitutes a routing protocol that remains functional in the presence of up to ƒ faults (of nodes and/or links). The problem of constructing such...

Optimal Locating-Total Dominating Sets in Strips of Height 3

Ville Junnila (2015)

Discussiones Mathematicae Graph Theory

A set C of vertices in a graph G = (V,E) is total dominating in G if all vertices of V are adjacent to a vertex of C. Furthermore, if a total dominating set C in G has the additional property that for any distinct vertices u, v ∈ V C the subsets formed by the vertices of C respectively adjacent to u and v are different, then we say that C is a locating-total dominating set in G. Previously, locating-total dominating sets in strips have been studied by Henning and Jafari Rad (2012). In particular,...

Currently displaying 1 – 12 of 12

Page 1