Embedding of and + into Arbitrary Tree
نویسندگان
چکیده
We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, Cn , and Cn 2 −1 + K1 into arbitrary tree. The embedding algorithms use a technique based on consecutive label property. Our algorithm calculates edge congestion in linear time.
منابع مشابه
Embedding an Arbitrary Binary Tree into the Star Graph
| Binary tree structures have been very useful in solving divide-and-conquer type of problems. Embedding binary trees into another network|the host network|helps in designing solutions for the host network using the known solutions on binary trees. Embedding arbitrary binary trees into networks, in particular into the hypercube, has been addressed in the literature. The latter was achieved with...
متن کاملEmbedding Graphs with Bounded Treewidth into Optimal Hypercubes
In this paper, we present a one-to-one embedding of a graph with bounded treewidth into its optimal hypercube. This is the first time that embeddings of graphs with a very irregular structure into hypercubes are investigated. The dilation of the presented embedding is bounded by , where denotes the treewidth of the graph and denotes the maximal degree of a vertex in the graph. The given embeddi...
متن کاملOn Generalized Injective Spaces in Generalized Topologies
In this paper, we first present a new type of the concept of open sets by expressing some properties of arbitrary mappings on a power set. With the generalization of the closure spaces in categorical topology, we introduce the generalized topological spaces and the concept of generalized continuity and become familiar with weak and strong structures for generalized topological spaces. Then, int...
متن کاملA New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube
The d-dimensional binary hypercube is a very popular model of parallel computation. On the other hand, the execution of many algorithms can be represented by binary trees, making desirable fast simulations of binary trees on hypercubes. In this paper, we present a simple one-to-one embedding of arbitrary binary trees into their optimal hypercubes with dilation 8 and constant congestion. The nov...
متن کاملKruskal-Friedman Gap Embedding Theorems over Well-Quasi-Orderings
We investigate new extensions of the Kruskal-Friedman theorems concerning well-quasiordering of finite trees with the gap condition. For two labelled trees s and t we say that s is embedded with gap into t if there is an injection from the vertices of s into t which maps each edge in s to a unique path in t with greater-or-equal labels. We show that finite trees are well-quasi-ordered with resp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013