대한전자공학회:학술대회논문집 (Proceedings of the IEEK Conference)
- 대한전자공학회 1998년도 하계종합학술대회논문집
- /
- Pages.289-292
- /
- 1998
완전이진트리의 이항트리에 대한 임베딩
Embedding Complete binary trees in Binomial trees
초록
Trees are the underlying structure for divide-and-conquer algorithms and the graphs that provide the solution spaces for NP-complete problems. Complete binary trees are the basic structure among trees. Therefore, if complete binary trees can be embedded in binomial trees, the algorithms which are provided by complete binary trees can be performed efficiently on the interconnection networks which have binomial trees as their subgraphs or in which binomial trees can be embedded easily. In this paper, we present dilation 2 embedding of complete binary trees in binomial trees.
키워드