The search functionality is under construction.

IEICE TRANSACTIONS on Fundamentals

Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids

Satoshi TAYU, Shuichi UENO

  • Full Text Views

    0

  • Cite this

Summary :

It has been known that an N-vertex binary tree can be embedded into the path and grid with dilation O(N/logN) and O((N/logN)), respectively. This paper shows that an N-vertex binary tree with proper pathwidth at most k can be embedded into the path grid with dilation O(N/N1/k) and O((N/N1/2k)), respectively.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E80-A No.1 pp.183-193
Publication Date
1997/01/25
Publicized
Online ISSN
DOI
Type of Manuscript
Category
Reliability and Fault Analysis

Authors

Keyword