Cutting Resilient Networks – Complete Binary Trees
نویسندگان
چکیده
منابع مشابه
Embedding Complete Binary Trees into Star Networks
Abs t rac t . Star networks have been proposed as a possible interconnection network for massively parallel computers. In this paper we investigate embeddings of complete binary trees into star networks. Let G and H be two networks represented by simple undirected graphs. An embedding of G into H is an injective mapping f from the vertices of G into the vertices of H. The dilation of the embedd...
متن کاملEmbedding Complete Binary Trees into Butterfly Networks
In this paper we present embeddings of complete binary trees into butterfly networks with or without wrap-around connections. Let m be an even integer and q = m+ LlogmJ-l. We show how to embed a 2+I -I-node complete binary tree T(q) into a (m + 1)2111+1_ node wrap-around butterfly B1l1(m +1) with a dilation of 4, and how to embed T(q) into a (m + 2)2+_node wrap-around butterfly B 1l1 (m +2) wit...
متن کاملEmbedding Complete Binary Trees into Butter y Networks
In this paper we present embeddings of complete binary trees into butter y networks with or without wrap-around connections. Let m be an even integer and q = m+ blogmc 1. We show how to embed a 2q+1 1-node complete binary tree T (q) into a (m + 1)2m+1node wrap-around butter y Bw(m+1) with a dilation of 4; and how to embed T (q) into a (m+2)2m+2-node wrap-around butter y Bw(m+2) with an optimal ...
متن کاملEmbedding Complete Binary Trees in Product Graphs
This paper shows how to embed complete binary trees in products of complete binary trees products of shu e exchange graphs and products of de Bruijn graphs The main emphasis of the embedding methods presented here is how to emulate arbitrarily large complete bi nary trees in these product graphs with low slowdown For the embedding methods presented here the size of the host graph can be xed to ...
متن کاملOptimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard in general, it becomes polynomially solvable if the set of feasible permutations is restricted to be compatible with a tree of bounded degree. We present a new algorithm for the elementary case of ordering the n leaves ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/8350