Proceedings of the IEEK Conference (대한전자공학회:학술대회논문집)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

Vertex disjoint covering cycle set in hypercubes

하이퍼큐브에서의 정점을 공유하지 않는 커버링사이클 집합

  • Park, Won (Dept. of Computer Science, Chonnam National University) ;
  • Lim, Hyeong-Seok (Dept. of Computer Science, Chonnam National University)
  • 박원 (전남대학교 전산학과) ;
  • 임형석 (전남대학교 전산학과)
  • Published : 2003.11.01
Download PDF
⟨ Previous Next ⟩

Abstract

In interconnection network for parallel processing, the cycle partitioning problem for parallel transmission with faulty vertieces or edges is very important. In this paper, we assume that k($\leq$m-1) edges do not share any vertices of m dimension hypercube Q$_{m}$ and show that it is possible to construct a cycle set which consists of k cycles covering all the vertices of the hypercube and one cycle including one of the given edges. This cycle set can be used to parallel transmission between two vertices joined by faulty edges.s.

Keywords