AbstractChannel graphs have been widely used in the study of blocking networks. In this paper, we show that a bit permutation network has a unique channel graph if and only if it is connected, and two connected bit permutation networks are isomorphic if and only if their channel graphs are isomorphic
A switching network of depth d is a layered graph with d layers and n vertices in each layer. The ed...
In many complex systems representable as networks, nodes can be separated into different classes. Of...
A token passing network is a directed graph with one or more specified input vertices and one or mo...
AbstractChannel graphs have been widely used in the study of blocking networks. In this paper, we sh...
AbstractIn this paper we study topological properties of multistage interconnection networks. We def...
International audienceIn this paper we study topological properties of multistage interconnection ne...
AbstractIn this paper, we introduce the concept of routing grid as a tool for analyzing realizabilit...
Rearrangeable multistage interconnection networks such as the Benes network realize any permutation,...
Abstract-We present analytic models for the blocking proba-bility of both unique path and multiple p...
AbstractSwitching networks of the type used in telephone exchanges are studied, with emphasis on a p...
AbstractA transportation graph is a directed graph with a designated input node and a designated out...
The five-layer network built using Pearson correlation is used as the base network. For each of the ...
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
Background: Much work in systems biology, but also in the analysis of social network and communicati...
A switching network of depth d is a layered graph with d layers and n vertices in each layer. The ed...
In many complex systems representable as networks, nodes can be separated into different classes. Of...
A token passing network is a directed graph with one or more specified input vertices and one or mo...
AbstractChannel graphs have been widely used in the study of blocking networks. In this paper, we sh...
AbstractIn this paper we study topological properties of multistage interconnection networks. We def...
International audienceIn this paper we study topological properties of multistage interconnection ne...
AbstractIn this paper, we introduce the concept of routing grid as a tool for analyzing realizabilit...
Rearrangeable multistage interconnection networks such as the Benes network realize any permutation,...
Abstract-We present analytic models for the blocking proba-bility of both unique path and multiple p...
AbstractSwitching networks of the type used in telephone exchanges are studied, with emphasis on a p...
AbstractA transportation graph is a directed graph with a designated input node and a designated out...
The five-layer network built using Pearson correlation is used as the base network. For each of the ...
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e...
Abstract. Rearrangeable networks can realize each and every permutation in one pass through the netw...
Background: Much work in systems biology, but also in the analysis of social network and communicati...
A switching network of depth d is a layered graph with d layers and n vertices in each layer. The ed...
In many complex systems representable as networks, nodes can be separated into different classes. Of...
A token passing network is a directed graph with one or more specified input vertices and one or mo...
DOI
Add to ORKG