Motivated by the study of hammock (aka brick-wall) networks, we introduce in this paper the
notion of X-path, which generates all possible connections through the network. The new …

In this paper, we develop a new method for evaluating the reliability polynomial of a
hammock network. The method is based on a homogeneous absorbing Markov chain and …

In this paper we assume that a network is a probabilistic graph where the vertices do not fail
while the edges do, being operational independently with probability p. The two most …

The aim of this paper is to give a characterization of the set of roots of a special family of
polynomials. This family is relevant in reliability theory since it contains the reliability …

It is well-known that in general the algorithms for determining the reliability polynomial
associated to a two-terminal network are computationally demanding, and even just …

It is a well-known fact that, in general, the combinatorial problem of finding the reliability
polynomial of a two-terminal network belongs to the class of\# P-complete problems. In …

Some properties of generalized convexity for sets and functions are identified in case of the
reliability polynomials of two dual minimal networks. A method of approximating the …

Recently, it was suggested that optimal sorting nets (which can trivially be mapped onto
hardware) could be used to design highly reliable networks/systems. Sorting nets …

It is well-known that finding the exact reliability polynomial of a given two-terminal network in
general is a highly demanding computational task (belonging to the# P-complete class of …

A Tale of Catalan Triangles: Counting Lattice Paths | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your research …