Channel graphs of bit permutation networks
Journal
Theoretical Computer Science
Journal Volume
263
Journal Issue
1-2
Pages
139-143
Date Issued
2001
Author(s)
Abstract
Channel graphs are widely used in the study of blocking networks. A bit permutation network having a unique channel graph is described. The network possessed such uniqueness if and only if its is connected. Furthermore, two connected bit permutation networks are found to be isomorphic if and only if their channel graphs are isomorphic.
Type
journal article