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
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a mod...
A transportation graph is a directed graph with a designated input node and a designated output node...
AbstractA construction is described to encode an arbitrary graph uniquely as a block design. This de...
AbstractChannel graphs have been widely used in the study of blocking networks. In this paper, we sh...
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e...
International audienceIn this paper we study topological properties of multistage interconnection ne...
A token passing network is a directed graph with one or more specified input vertices and one or mo...
AbstractIn this paper we study topological properties of multistage interconnection networks. We def...
AbstractIn this paper, we introduce the concept of routing grid as a tool for analyzing realizabilit...
One of the central tools developed by M. Minsky and S. Papert (1988) was the group invariance theore...
An active area of research in computational science is the design of algorithms for solving the subg...
In many complex systems representable as networks, nodes can be separated into different classes. Of...
Networks play an important role in electrical and electronic engineering. It depends on what area of...
Graph matching algorithms rely on the availability of seed vertex pairs as side information to deano...
Abstract: The simple greedy algorithm to find a maximal independent set of a graph can be viewed as ...
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a mod...
A transportation graph is a directed graph with a designated input node and a designated output node...
AbstractA construction is described to encode an arbitrary graph uniquely as a block design. This de...
AbstractChannel graphs have been widely used in the study of blocking networks. In this paper, we sh...
We extend the concept of graph isomorphisms to multilayer networks with any number of "aspects" (i.e...
International audienceIn this paper we study topological properties of multistage interconnection ne...
A token passing network is a directed graph with one or more specified input vertices and one or mo...
AbstractIn this paper we study topological properties of multistage interconnection networks. We def...
AbstractIn this paper, we introduce the concept of routing grid as a tool for analyzing realizabilit...
One of the central tools developed by M. Minsky and S. Papert (1988) was the group invariance theore...
An active area of research in computational science is the design of algorithms for solving the subg...
In many complex systems representable as networks, nodes can be separated into different classes. Of...
Networks play an important role in electrical and electronic engineering. It depends on what area of...
Graph matching algorithms rely on the availability of seed vertex pairs as side information to deano...
Abstract: The simple greedy algorithm to find a maximal independent set of a graph can be viewed as ...
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a mod...
A transportation graph is a directed graph with a designated input node and a designated output node...
AbstractA construction is described to encode an arbitrary graph uniquely as a block design. This de...
DOI
Add to ORKG