Channel graphs of bit permutation networks

@article{Tong2001ChannelGO,
  title={Channel graphs of bit permutation networks},
  author={Li-Da Tong and Frank K. Hwang and Gerard J. Chang},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={263},
  pages={139-143}
}
Channel 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. c © 2001 Elsevier Science B.V. All rights reserved. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Superior channel graphs

  • F. K. Hwang
  • Proc. 9th Internat. TeletraKc Congr…
  • 2001
1 Excerpt

Similar Papers

Loading similar papers…