earticle

논문검색

Embedding Algorithm among Half Pancake, Pancake, and Star Graphs

초록

영어

The star graph is an attractive alternative to hypercube. The pancake graph has n! nodes and generates edge using exchange of a symbol that composes a node address like star graph. The half pancake graph is a new network where the network cost of pancake graph is reduced by half. We suggest embedding algorithm among these networks. The half pancake HPn was embedded on pancake Pn with dilation 1 and congestion 1. The half pancake Pn was embedded on star graph Sn with dilation 1.5n-2, average dilation about 0.25n+4, and congestion 6. The pancake Pn was embedded on star graph Sn with dilation 1.5n. All the three of embedding were one-to-one embedding with expansion 1.

목차

Abstract
 1. Introduction
 2. Related Work and Preliminaries
 3. Embedding Algorithm
  3.1. Embedding of half pancake onto pancake
  3.2. Embedding of half pancake onto star
  3.3. Embedding of Pancake onto Star
 4. Conclusion
 Acknowledgement
 References

저자정보

  • Jung-hyun Seo Dept. of Computer Eng., National Univ. of Sunchon, Sunchon, Chonnam, 540-950, Republic of Korea
  • HyeongOk Lee Dept. of Computer Edu., National Univ. of Sunchon, jungang-ro 255, Sunchon, Chonnam, 540-950, Republic of Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.