Embedding Large Complete Binary Trees in Hypercubes with Load Balancing
|
|
- Laureen Perry
- 5 years ago
- Views:
Transcription
1 JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 35, (1996) ARTICLE NO Embedding Large Complete Binary Trees in Hypercubes with Load Balancing KEMAL EFE Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette, Louisiana This paper presents two methods for embedding arbitrarily large complete binary trees in fixed size hypercubes. The ability to embed arbitrarily large graphs in smaller graphs has important applications in massively parallel computing. The presented embedding methods are optimized mainly for balancing the processor loads, while minimizing dilation and congestion as far as possible Academic Press, Inc. 1. INTRODUCTION This paper presents methods for embedding large complete binary trees in fixed size hypercubes. If implemented in a compiler, such embeddings allow the programmer to view the system as a tree machine with no bound on its size. Due to its significant practical applications, the problem of embedding trees in hypercubes has received much attention in the literature. For example, many researchers [1, 5, 6, 11, 15] have presented methods for embedding complete binary trees into their like-size hypercubes. Ho and Johnsson investigated spanning trees and balanced spanning trees in the hypercube [7]. Bhatt et al. [2, 3] investigated embedding of arbitrary trees and graphs with O(1) separators, and Monien and Sudborough [13] investigated the embedding of incomplete binary trees in their smallest size hypercubes with enough nodes. The emphasis of this paper is different from the above works, in that we address optimal embeddings of arbitrary size complete binary trees in fixed size hypercubes. Our main focus is on how to balance the load of embedding while minimizing dilation and congestion (these terms will be defined in the next section). We are motivated by the fact that a given parallel computer has a fixed number of processors by its physical design, while the size of the tree being embedded can vary depending on the application. The mapping should be optimum for all problem and system sizes. The problem of embedding large graphs in smaller hypercubes has been investigated previously [4, 8, 10, 12], and embedding methods have been developed for various structures. However, there is no paper that shows how to embed arbitrary size complete binary trees into fixed size hypercubes with load balancing. In the next section we present basic definitions and notations where the criterion of optimality is defined and related to the concept of normal algorithms. In Section 3 we present an optimal embedding method that balances the processor loads. In Section 4 we present a nonoptimal embedding method which has the advantage of simplicity. In Section 5 we present our concluding remarks. 2. DEFINITIONS AND MOTIVATIONS Emulation of a guest graph G by a host graph H means performance of the steps of an algorithm developed for the guest on the processors of the host. The major cost measure in emulating one graph by another is the slowdown. This is the ratio of the emulation time on the host to the running time on the guest. The slowdown of emulation depends on the following cost parameters: Load. The maximum number of nodes of G mapped to any node of H. Dilation. The length of the longest path in H to which any edge of G is mapped. Congestion. The maximum number of paths (images of the edges of G) which share an edge of H. If G is not larger than H, and if the embedding is isomorphic, then there is no slowdown and the algorithm running on the system cannot tell the difference between G and H from the viewpoint of the above cost measures. When the guest graph is larger than the host graph, then the load of embedding must be at least V G /V H, where V G and V H are the numbers of nodes in the guest and host, respectively. If the load is V G /V H, then the load of embedding is balanced. In this case, the slowdown of emulation is S O(V G /V H ) if dilation and congestion are O(1). When we pay special attention to the common requirements of algorithms developed for the guest architecture, it may be possible to remove the big-oh notation from the slowdown expressions, and define strict requirements for optimality of emulations. This is possible because most parallel architectures have their corresponding favorite computation types for which they are topologically well suited /96 $18.00 Copyright 1996 by Academic Press, Inc. All rights of reproduction in any form reserved. 104
2 EMBEDDING TREES IN HYPERCUBES 105 For complete binary trees, a common pattern of computation has been observed by many researchers. This pattern is termed normal by Ullman [14] (also sometimes called leveled algorithms in other papers). Normal algorithms running on the binary tree architecture use only one level of the tree nodes at a time. Also, communication is between adjacent levels of tree nodes. This represents all semigroup computations, prefix computations, searching and many other divide-and-conquer algorithms. The consideration of normal algorithms allows us to identify the subset of busy tree nodes for each step of computation and balance the busy workload assigned to each hypercube node for every step of emulation. Normalized Embedding. If an embedding is specifically optimized for the needs of normal algorithms running on complete binary trees, then we call this embedding normalized. These embeddings must satisfy the following requirements: (a) the nodes at each level of the tree must be distributed equally between the nodes of the hypercube; (b) dilation of the embedding must be unit; and (c) the actual congestion of embedding must be unit. Actual congestion is the congestion which occurs during a normal computation and it is different from the graph theoretical definition above. The graph theoretical definition of congestion is an upper bound on the actual congestion. Depending on the communication patterns of a computation, the actual congestion may be less. 3. AN OPTIMAL EMBEDDING METHOD FIG. 2. Construction of the normalized tree. Consider a complete binary tree T r, where r is the number of levels. Assume that the levels of the tree are indexed as 0,..., (r 1) starting from the root. In this paper, we say higher levels to refer to the levels of the tree near the root. Lower levels refer to the levels near the leaves. It is well known that T r is not a subgraph of the r-dimensional hypercube Q r, but that if we modify the tree so that it has two roots as shown in Fig. 1, the resulting graph is a subgraph of the hypercube. This graph is frequently referred to as double-rooted tree in the literature. For a double-rooted tree, which we denote as DT r, the indexing of levels is the same as that of T r, except that level 0 has two nodes. In many of the papers cited above, it is convincingly argued that DT r can emulate T r with negligible overhead, since only one edge of T r maps to a distance of 2. We therefore assume in this paper that emulating DT r on the hypercube is a desirable alternative to emulating T r. FIG. 1. Double rooted tree. The following theorem is one of the two main results of this paper. THEOREM 1. DT r k in Q r. There exists a normalized embedding of Proof. Our approach for proving this theorem is as follows: First, we construct a new graph, which we call a normalized tree of order r (or NT r for short). Then we show that there exists a normalized embedding of DT r k on NT r with unit dilation and unit congestion. Finally we show that NT r can be embedded in Q r with unit dilation and unit actual congestion. NT r is constructed recursively as follows: As a basis, NT 2 is obtained from DT 2 by adding two dotted edges from the leaves to the two roots (see Fig. 2a). Suppose NT r 1 is a copy of NT r 1 (see Fig. 2b). Let u, v denote the two roots of NT r 1, with x and y as the roots of their subtrees. Similarly, for NT r 1, we have the vertices u, v, x, y with the corresponding roles. We construct NT r from these graphs by adding edges (u, u ), (v, x ), (v, x), and deleting the edges (u, x), and (u, x ), as shown in Figs. 2c and 2d. Figure 3 shows NT 3 and NT 4 as examples. Let u be a leaf vertex in NT r. We say that the vertex v is the parent of u if and only if there is a dotted edge (u, v). Note that for half of the leaf nodes, the parent is the same node as in the traditional definition of parent for
3 106 KEMAL EFE binary trees. For the other half of leaves, the parent is an internal node. For the purpose of the proof of above theorem, we need the following fact. LEMMA 1. If u is a vertex in NT r, then u either is a leaf, or is the parent of a leaf. Moreover, no two leaves have the same parent. Proof. The claim is true for r 4 by inspection of Fig. 3. For r 4, suppose the two copies of NT r 1 used for constructing NT r satisfy the claim. Then, NT r will also satisfy the claim since no dotted edges are deleted during its construction from two copies of NT r 1. We can now easily show that there is a normalized mapping from the nodes of DT r k to the nodes of NT r. The mapping of the highest r levels of DT r is straightforward: Every edge (u, v) is mapped to its corresponding (solid) edge in NT r. This leaves 2 r 1 subtrees, each with height k 1, yet to be assigned. Let u be a leaf node in NT r. Also let u be the corresponding node of DT r which has already been assigned to u, with x and y as its two children nodes (see Fig. 4a). Assign the subtree rooted at x to u, and the subtree rooted at y to the parent of u. From Lemma 1 we know that each subtree is assigned to a distinct node of NT r. Figure 4b shows the embedding of a large binary tree in the 8-node normalized tree. It is clear that the dilation and congestion of this embedding are unit. Moreover, for normal algorithms, every node of NT r is equally busy while emulating the work of the levels below r 1ofDT r k. To complete the proof of the theorem it remains to show the following. LEMMA 2. NT r can be embedding in Q r with dilation 1 and congestion 2 such that the congestion of 2 occurs only where there are a solid edge and a dotted edge connecting the same pair of nodes. Remark. Note that solid edges and dotted edges are not used at the same step of a normal computation. Thus, the actual congestion of the emulation is unit. Proof. We prove the lemma by construction of the embedding recursively. Let diff (z, t) be a function which returns the differing bit position between the adjacent vertices z and t of a hypercube. As shown in Fig. 5a, NT 2 can be embedded in Q 2 as claimed. For r 2, assume that NT r 1 is a subgraph of Q r 1, with u and v as the two roots and x and y as the roots of their subtrees. Let i diff (u, FIG. 3. Normalized trees of height 2, 3, and 4. FIG. 4. Embedding of a large binary tree in the normalized tree. x), and j diff (u, v). Note from the basis case of Fig. 5a that bit values at the ith and jth bit positions of u are both zero. Our construction method relies on this property and preserves it at every step of recursion. First, let NT r 1 be the copy in Q r 1.Ifu,v are the two roots of NT r 1, with x and y as the roots of their subtrees, then again the ith and jth bit positions of u are both zero, where i diff (u, x ), and j diff (u, v ). If we exchange the bits at positions i and j for every vertex in NT r 1, the root u will remain in its original address. However, this bit exchange will bring v to the same address as x, and bring x to the same address as v. Now if we connect Q r 1 and Q r 1 to obtain Q r (and prefix every vertex label in Q r 1 with 0, and those in Q r 1 with 1), we observe two cycles. One of these cycles contains u, u, v, x, and the other cycle contains u, u, x, v. By adding the edges (u, u ), (x, v ), (v, x ) and deleting the edges (u, x), (u, x ), we obtain the desired NT r. After this step, the new labels are computed as u u, x v, v u, y v, which implies that i j and j r, and, it is concluded that the vertex u continues to have its ith and jth bits equal (both zero). Figure 5c shows the embedding of a 16-node normalized tree in the hypercube. This completes the proof of Lemma 2 and the proof of Theorem A NONOPTIMAL METHOD In this section we consider a nonoptimal method. This method is interesting, because it is simple and easy to implement. This approach uses a well known embedding method [3, 9], based on assigning labels 0 2 r 1 to the nodes of complete binary tree tracing the nodes in inorder sequence. Figure 6 shows the assignment of labels where it is assumed that the tree is a left subtree of an auxiliary root node with label The labels assigned this way on tree nodes indicate which hypercube nodes they are mapped to. Note that, since an internal vertex u and its right descendent differ in two bit positions, there are exactly two paths of length 2 between the corresponding nodes of the hypercube. One is through the left descendent of u, and the other is through the parent of u. In both cases, we must incur a congestion of 2. For the purposes of this section, we assume that the edge from a node u to its right child is routed through the parent of u.
4 EMBEDDING TREES IN HYPERCUBES 107 FIG. 5. Embedding of the normalized tree in the hypercube. Before discussing how to extend this method for embedding large trees in fixed size hypercubes, we present a new operation defined on hypercubes as follows: Contracting the r-dimensional hypercube at dimension i means joining each vertex u with its dimension-i neighbor. The resulting hypercube contains half as many nodes as before, and the ith bit position for each vertex label be- comes the don t care symbol x. This is illustrated in Fig. 7. We can now give the main result for the inorder embedding method. THEOREM 2. For the embedding of complete binary tree in a hypercube by inorder labeling, the load of each proces- FIG. 6. Inorder labeling of a complete binary tree induces an embedding in the hypercube. FIG. 7. Contracting the three-dimensional hypercube of (a) in dimension 2 (b), dimension 1, (c), and dimension 0 (d).
5 108 KEMAL EFE FIG. 8. Embedding a large tree in a small hypercube by repeated contractions. Dotted lines show the new edges created by the contraction. sor can be doubled by contracting the hypercube at the lowest dimension. In the resultant smaller hypercube each leaf will be at distance 0 or 1 from its parent. The internal nodes will be at the same distance from their parents as before contraction. Proof. For the purposes of this proof, assume that the levels of the tree are numbered starting from the leaves, with leaves at level 0. From the construction of inorder embedding, observe that the binary label of each left child at level i differs from the label of its parent at dimension i and the label of right child differs from that of its parent at dimensions i and i 1. Moreover, for every node at level i the binary label differs from that of its inorder successor at dimension i. Then, it immediately follows that if we contract the hypercube (with tree embedded in it) at the lowest dimension, we have a one to one mapping of 2 r 1 leaves onto 2 r 1 internal nodes. In particular, each leaf is mapped to its inorder successor. To embed a large binary tree to a smaller hypercube, we can start with a unit load embedding of the required size and repeatedly apply the above theorem, contracting the hypercube at the next lowest dimension. Figure 8 shows this process starting with a 16 node binary tree. The following fact implies that, when emulating a normal algorithm, each node of the hypercube will be equally busy for every step of emulation. COROLLARY 1. The embedding method of Theorem 2 distributes the leaves uniformly between the nodes of the hypercube. If repeated k times, this method yields a balanced distribution of the tree nodes for each of the lowest k levels of the tree. Proof follows from the fact that each contraction step maps the leaves to their inorder successors. The disadvantages of this method are that (a) every edge from an internal node to its right descendent is mapped with dilation 2, and (b) the congestion of embedding is 2. However, the actual congestion will still be unit for a normal computation. 5. CONCLUDING REMARKS We presented two methods for embedding arbitrarily large complete binary trees in fixed size hypercubes. The first method is more complex to implement but it is optimal, while the second method is easier to implement but is nonoptimal. An occasional user may find it easier to implement the nonoptimal method. If the first method is implemented in a compiler, it may be used by any application program without the user having to define the mapping. REFERENCES 1. Bhatt, S. N., and Ipsen, I. C. F. How to embed trees in hypercubes. Rep. YALE/DCS/RR-43, Department of Computer Science, Yale University, Bhatt, S. N., Chung, F., Leighton, T., and Rosenberg, A. Optimal simulation of tree machines. Proceedings of the th Annual Symposium of Foundations of Computer Science. Pp Bhatt, S. N., Chung, F. R. K., Leighton, F. T., and Rosenberg, A. L. Efficient embeddings of trees in hypercubes. SIAM J. Comput. 21, 1 (Feb. 1992), Chan, T. F., and Saad, Y. Multigrid algorithms on the hypercube multiprocessor. IEEE Trans. Comput. 35, 11 (Nov. 1986), Desphande, S. R., and Jenevein, R. Scalability of binary trees on a hypercube. Proc International Conference on Parallel Processing. Pp Efe, K. Embedding mesh of trees in the hypercube. J. Parallel Distrib. Comput. 11, 3 (Mar. 1991), Ho, C-T., and Johnsson, S. L. Spanning balanced trees in Boolean cubes. SIAM J. Sci. Statist. Comput. 10, 4 (July 1989), Ho, C. T., and Johnsson, S. L. Embedding hyper-pyramids into hypercubes, IBM J. Res. Dev. 38, 1 (Jan. 1994), Johnsson, S. L. Communication efficient basic linear algebra computations on hypercube architectures. J. Parallel Distrib. Comput. 4, 2 (Apr. 1987), Koch, R., Leighton, T., Maggs, B., Rao, S., and Rosenberg, A. Workpreserving emulations of fixed-connection networks. Proc. 21st Annual ACM Symposium on Theory of Computing. 1989, pp Leiss, I. L., and Reddy, H. N. Embedding complete binary trees into hypercubes. Inform. Process. Lett. 38, (May 1991), Miller, Z., and Sudborough, I. H. Compressing grids into small hypercubes. Networks 24 (1994). 13. Monien, B., and Sudborough, I. H. Simulating binary trees on hypercubes. Proc. 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, Corfu, Greece, Lecture Notes in Computer Science, Vol Springer-Verlag, Berlin/New York, 1988, pp Ullman, J. D. Computational Aspects of VLSI. Comput. Sci. Press, New York, Wu, A. Y. Embedding of tree networks into hypercubes. J. Parallel Distrib. Comput. 2, 3 (Aug. 1985), KEMAL EFE received the B.Sc. in electronic engineering from Istanbul Technical University, the M.S. in computer science from the Univer-
6 EMBEDDING TREES IN HYPERCUBES 109 sity of California, Los Angeles, and the Ph.D. in computer science from the University of Leeds. He is currently an associate professor of computer science in the Center for Advanced Computer Studies, University of Southwestern Louisiana, Lafayette. His research interests are in parallel architectures and algorithms, interconnection networks, distributed op- erating systems, performance evaluation, and algorithms for loosely coupled workstation networks. Dr. Efe has served on the technical committees of several conferences and has given invited talks in the U.S. and Europe. In 1995, he received the certificate of recognition from NASA for his research contributions. He is a member of the ACM and the IEEE. Received July 11, 1994; revised February 22, 1996; accepted February 26, 1996
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae 56 (2003) 105 120 105 IOS Press A Fast Algorithm for Optimal Alignment between Similar Ordered Trees Jesper Jansson Department of Computer Science Lund University, Box 118 SE-221
More informationA Connection between Network Coding and. Convolutional Codes
A Connection between Network Coding and 1 Convolutional Codes Christina Fragouli, Emina Soljanin christina.fragouli@epfl.ch, emina@lucent.com Abstract The min-cut, max-flow theorem states that a source
More informationCS 441 Discrete Mathematics for CS Lecture 26. Graphs. CS 441 Discrete mathematics for CS. Final exam
CS 441 Discrete Mathematics for CS Lecture 26 Graphs Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Final exam Saturday, April 26, 2014 at 10:00-11:50am The same classroom as lectures The exam
More informationThe Transformation of Optimal Independent Spanning Trees in Hypercubes
The Transformation of Optimal Independent Spanning Trees in Hypercubes Shyue-Ming Tang, Yu-Ting Li, and Yue-Li Wang Fu Hsing Kang School, National Defense University, Taipei, Taiwan, R.O.C. Department
More informationInduced-universal graphs for graphs with bounded maximum degree
Induced-universal graphs for graphs with bounded maximum degree Steve Butler UCLA, Department of Mathematics, University of California Los Angeles, Los Angeles, CA 90095, USA. email: butler@math.ucla.edu.
More informationProperties of red-black trees
Red-Black Trees Introduction We have seen that a binary search tree is a useful tool. I.e., if its height is h, then we can implement any basic operation on it in O(h) units of time. The problem: given
More informationThe 3-Steiner Root Problem
The 3-Steiner Root Problem Maw-Shang Chang 1 and Ming-Tat Ko 2 1 Department of Computer Science and Information Engineering National Chung Cheng University, Chiayi 621, Taiwan, R.O.C. mschang@cs.ccu.edu.tw
More informationData Communication and Parallel Computing on Twisted Hypercubes
Data Communication and Parallel Computing on Twisted Hypercubes E. Abuelrub, Department of Computer Science, Zarqa Private University, Jordan Abstract- Massively parallel distributed-memory architectures
More informationTriangle Graphs and Simple Trapezoid Graphs
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 18, 467-473 (2002) Short Paper Triangle Graphs and Simple Trapezoid Graphs Department of Computer Science and Information Management Providence University
More informationMarch 20/2003 Jayakanth Srinivasan,
Definition : A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Definition : In a multigraph G = (V, E) two or
More informationTrees. 3. (Minimally Connected) G is connected and deleting any of its edges gives rise to a disconnected graph.
Trees 1 Introduction Trees are very special kind of (undirected) graphs. Formally speaking, a tree is a connected graph that is acyclic. 1 This definition has some drawbacks: given a graph it is not trivial
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationParameterized coloring problems on chordal graphs
Parameterized coloring problems on chordal graphs Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary dmarx@cs.bme.hu
More informationSDSU CS 662 Theory of Parallel Algorithms Networks part 2
SDSU CS 662 Theory of Parallel Algorithms Networks part 2 ---------- [To Lecture Notes Index] San Diego State University -- This page last updated April 16, 1996 Contents of Networks part 2 Lecture 1.
More informationThe Postal Network: A Versatile Interconnection Topology
The Postal Network: A Versatile Interconnection Topology Jie Wu Yuanyuan Yang Dept. of Computer Sci. and Eng. Dept. of Computer Science Florida Atlantic University University of Vermont Boca Raton, FL
More informationThe Fibonacci hypercube
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 40 (2008), Pages 187 196 The Fibonacci hypercube Fred J. Rispoli Department of Mathematics and Computer Science Dowling College, Oakdale, NY 11769 U.S.A. Steven
More informationChordal deletion is fixed-parameter tractable
Chordal deletion is fixed-parameter tractable Dániel Marx Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. dmarx@informatik.hu-berlin.de Abstract. It
More informationApplied Mathematics Letters. Graph triangulations and the compatibility of unrooted phylogenetic trees
Applied Mathematics Letters 24 (2011) 719 723 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Graph triangulations and the compatibility
More informationLecture 3 February 9, 2010
6.851: Advanced Data Structures Spring 2010 Dr. André Schulz Lecture 3 February 9, 2010 Scribe: Jacob Steinhardt and Greg Brockman 1 Overview In the last lecture we continued to study binary search trees
More informationLecture 4: September 11, 2003
Algorithmic Modeling and Complexity Fall 2003 Lecturer: J. van Leeuwen Lecture 4: September 11, 2003 Scribe: B. de Boer 4.1 Overview This lecture introduced Fixed Parameter Tractable (FPT) problems. An
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Summary of the Ph.D. thesis by Gabriella Divéki Supervisor Dr. Csanád Imreh
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationIntroduction to Computers and Programming. Concept Question
Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 7 April 2 2004 Concept Question G1(V1,E1) A graph G(V, where E) is V1 a finite = {}, nonempty E1 = {} set of G2(V2,E2) vertices and
More informationNotes on Binary Dumbbell Trees
Notes on Binary Dumbbell Trees Michiel Smid March 23, 2012 Abstract Dumbbell trees were introduced in [1]. A detailed description of non-binary dumbbell trees appears in Chapter 11 of [3]. These notes
More informationBinary Heaps in Dynamic Arrays
Yufei Tao ITEE University of Queensland We have already learned that the binary heap serves as an efficient implementation of a priority queue. Our previous discussion was based on pointers (for getting
More informationSection Summary. Introduction to Trees Rooted Trees Trees as Models Properties of Trees
Chapter 11 Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Introduction to Trees Applications
More information4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
More informationThe Hamiltonicity of Crossed Cubes in the Presence of Faults
The Hamiltonicity of Crossed Cubes in the Presence of Faults E. Abuelrub, Member, IAENG Abstract The crossed cube is considered as one of the most promising variations of the hypercube topology, due to
More informationTrees. Q: Why study trees? A: Many advance ADTs are implemented using tree-based data structures.
Trees Q: Why study trees? : Many advance DTs are implemented using tree-based data structures. Recursive Definition of (Rooted) Tree: Let T be a set with n 0 elements. (i) If n = 0, T is an empty tree,
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationA COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS. and. and
Parallel Processing Letters c World Scientific Publishing Company A COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS DANNY KRIZANC Department of Computer Science, University of Rochester
More informationMulticasting in the Hypercube, Chord and Binomial Graphs
Multicasting in the Hypercube, Chord and Binomial Graphs Christopher C. Cipriano and Teofilo F. Gonzalez Department of Computer Science University of California, Santa Barbara, CA, 93106 E-mail: {ccc,teo}@cs.ucsb.edu
More informationOn the Relationships between Zero Forcing Numbers and Certain Graph Coverings
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings Fatemeh Alinaghipour Taklimi, Shaun Fallat 1,, Karen Meagher 2 Department of Mathematics and Statistics, University of Regina,
More informationAn Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem
An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem Ahmad Biniaz Anil Maheshwari Michiel Smid September 30, 2013 Abstract Let P and S be two disjoint sets of n and m points in the
More informationAll-port Total Exchange in Cartesian Product Networks
All-port Total Exchange in Cartesian Product Networks Vassilios V. Dimakopoulos Dept. of Computer Science, University of Ioannina P.O. Box 1186, GR-45110 Ioannina, Greece. Tel: +30-26510-98809, Fax: +30-26510-98890,
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 2769 2775 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Optimal acyclic edge colouring of grid like graphs
More informationRecognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality Hans L. Bodlaender, Utrecht University and Eindhoven University of Technology Pinar Heggernes, University of Bergen
More informationThe self-minor conjecture for infinite trees
The self-minor conjecture for infinite trees Julian Pott Abstract We prove Seymour s self-minor conjecture for infinite trees. 1. Introduction P. D. Seymour conjectured that every infinite graph is a proper
More informationAlgorithmic Aspects of Communication Networks
Algorithmic Aspects of Communication Networks Chapter 5 Network Resilience Algorithmic Aspects of ComNets (WS 16/17): 05 Network Resilience 1 Introduction and Motivation Network resilience denotes the
More information6. Concluding Remarks
[8] K. J. Supowit, The relative neighborhood graph with an application to minimum spanning trees, Tech. Rept., Department of Computer Science, University of Illinois, Urbana-Champaign, August 1980, also
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationA generalization of Mader s theorem
A generalization of Mader s theorem Ajit A. Diwan Department of Computer Science and Engineering Indian Institute of Technology, Bombay Mumbai, 4000076, India. email: aad@cse.iitb.ac.in 18 June 2007 Abstract
More informationSome Applications of Graph Bandwidth to Constraint Satisfaction Problems
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems Ramin Zabih Computer Science Department Stanford University Stanford, California 94305 Abstract Bandwidth is a fundamental concept
More informationEfficient Bufferless Packet Switching on Trees and Leveled Networks
Efficient Bufferless Packet Switching on Trees and Leveled Networks Costas Busch Malik Magdon-Ismail Marios Mavronicolas Abstract In bufferless networks the packets cannot be buffered while they are in
More information13.4 Deletion in red-black trees
Deletion in a red-black tree is similar to insertion. Apply the deletion algorithm for binary search trees. Apply node color changes and left/right rotations to fix the violations of RBT tree properties.
More informationParameterized graph separation problems
Parameterized graph separation problems Dániel Marx Department of Computer Science and Information Theory, Budapest University of Technology and Economics Budapest, H-1521, Hungary, dmarx@cs.bme.hu Abstract.
More informationFOUR EDGE-INDEPENDENT SPANNING TREES 1
FOUR EDGE-INDEPENDENT SPANNING TREES 1 Alexander Hoyer and Robin Thomas School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332-0160, USA ABSTRACT We prove an ear-decomposition theorem
More information13.4 Deletion in red-black trees
The operation of Deletion in a red-black tree is similar to the operation of Insertion on the tree. That is, apply the deletion algorithm for binary search trees to delete a node z; apply node color changes
More informationTrees. Arash Rafiey. 20 October, 2015
20 October, 2015 Definition Let G = (V, E) be a loop-free undirected graph. G is called a tree if G is connected and contains no cycle. Definition Let G = (V, E) be a loop-free undirected graph. G is called
More informationHW Graph Theory SOLUTIONS (hbovik) - Q
1, Diestel 9.3: An arithmetic progression is an increasing sequence of numbers of the form a, a+d, a+ d, a + 3d.... Van der Waerden s theorem says that no matter how we partition the natural numbers into
More information3 Competitive Dynamic BSTs (January 31 and February 2)
3 Competitive Dynamic BSTs (January 31 and February ) In their original paper on splay trees [3], Danny Sleator and Bob Tarjan conjectured that the cost of sequence of searches in a splay tree is within
More informationThe problem of minimizing the elimination tree height for general graphs is N P-hard. However, there exist classes of graphs for which the problem can
A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs Bengt Aspvall, Pinar Heggernes, Jan Arne Telle Department of Informatics, University of Bergen N{5020 Bergen,
More informationSparse Hypercube 3-Spanners
Sparse Hypercube 3-Spanners W. Duckworth and M. Zito Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3052, Australia Department of Computer Science, University of
More informationComponent connectivity of crossed cubes
Component connectivity of crossed cubes School of Applied Mathematics Xiamen University of Technology Xiamen Fujian 361024 P.R.China ltguo2012@126.com Abstract: Let G = (V, E) be a connected graph. A r-component
More information9 Distributed Data Management II Caching
9 Distributed Data Management II Caching In this section we will study the approach of using caching for the management of data in distributed systems. Caching always tries to keep data at the place where
More informationLoad Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations
Load Balancing for Problems with Good Bisectors, and Applications in Finite Element Simulations Stefan Bischof, Ralf Ebner, and Thomas Erlebach Institut für Informatik Technische Universität München D-80290
More informationPrefix Computation and Sorting in Dual-Cube
Prefix Computation and Sorting in Dual-Cube Yamin Li and Shietung Peng Department of Computer Science Hosei University Tokyo - Japan {yamin, speng}@k.hosei.ac.jp Wanming Chu Department of Computer Hardware
More informationNode-to-Set Vertex Disjoint Paths in Hypercube Networks
Computer Science Technical Report Node-to-Set Vertex Disjoint Paths in Hypercube Networks Shahram Latifi y, Hyosun Ko z, and Pradip K Srimani x Technical Report CS-98-7 Computer Science Department Colorado
More informationA note on Baker s algorithm
A note on Baker s algorithm Iyad A. Kanj, Ljubomir Perković School of CTI, DePaul University, 243 S. Wabash Avenue, Chicago, IL 60604-2301. Abstract We present a corrected version of Baker s algorithm
More informationOptimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of C
Optimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of California, San Diego CA 92093{0114, USA Abstract. We
More informationASYMMETRIC COMMUNICATION PROTOCOLS VIA HOTLINK ASSIGNMENTS
ASYMMETRIC COMMUNICATION PROTOCOLS VIA OTLINK ASSIGNMENTS Prosenjit Bose Danny Krizanc Stefan Langerman Pat Morin Abstract. We exhibit a relationship between the asymmetric communication problem of Adler
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationPAPER Node-Disjoint Paths Algorithm in a Transposition Graph
2600 IEICE TRANS. INF. & SYST., VOL.E89 D, NO.10 OCTOBER 2006 PAPER Node-Disjoint Paths Algorithm in a Transposition Graph Yasuto SUZUKI, Nonmember, Keiichi KANEKO a), and Mario NAKAMORI, Members SUMMARY
More informationTopics. Trees Vojislav Kecman. Which graphs are trees? Terminology. Terminology Trees as Models Some Tree Theorems Applications of Trees CMSC 302
Topics VCU, Department of Computer Science CMSC 302 Trees Vojislav Kecman Terminology Trees as Models Some Tree Theorems Applications of Trees Binary Search Tree Decision Tree Tree Traversal Spanning Trees
More informationEnumerating All Rooted Trees Including k Leaves
IEICE TRANS. INF. & SYST., VOL.E95 D, NO.3 MARCH 2012 763 PAPER Special Section on Foundations of Computer Science Enumerating All Rooted Trees Including k Leaves Masanobu ISHIKAWA a), Nonmember, Katsuhisa
More informationLectures 8/9. 1 Overview. 2 Prelude:Routing on the Grid. 3 A couple of networks.
U.C. Berkeley CS273: Parallel and Distributed Theory Lectures 8/9 Professor Satish Rao September 23,2010 Lecturer: Satish Rao Last revised October 23, 2010 Lectures 8/9 1 Overview We will give a couple
More informationRectangular Matrix Multiplication Revisited
JOURNAL OF COMPLEXITY, 13, 42 49 (1997) ARTICLE NO. CM970438 Rectangular Matrix Multiplication Revisited Don Coppersmith IBM Research, T. J. Watson Research Center, Yorktown Heights, New York 10598 Received
More informationCleaning an Arbitrary Regular Network with Mobile Agents
Cleaning an Arbitrary Regular Network with Mobile Agents Paola Flocchini, Amiya Nayak and Arno Schulz School of Information Technology and Engineering University of Ottawa 800 King Edward Avenue Ottawa,
More informationApproximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks
Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1
More informationThe NP-Completeness of Some Edge-Partition Problems
The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006
More informationChapter 3 Trees. Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
More informationOn Acyclic Vertex Coloring of Grid like graphs
On Acyclic Vertex Coloring of Grid like graphs Bharat Joshi and Kishore Kothapalli {bharatj@research., kkishore@}iiit.ac.in Center for Security, Theory and Algorithmic Research International Institute
More informationA SIMPLE APPROXIMATION ALGORITHM FOR NONOVERLAPPING LOCAL ALIGNMENTS (WEIGHTED INDEPENDENT SETS OF AXIS PARALLEL RECTANGLES)
Chapter 1 A SIMPLE APPROXIMATION ALGORITHM FOR NONOVERLAPPING LOCAL ALIGNMENTS (WEIGHTED INDEPENDENT SETS OF AXIS PARALLEL RECTANGLES) Piotr Berman Department of Computer Science & Engineering Pennsylvania
More informationThese notes present some properties of chordal graphs, a set of undirected graphs that are important for undirected graphical models.
Undirected Graphical Models: Chordal Graphs, Decomposable Graphs, Junction Trees, and Factorizations Peter Bartlett. October 2003. These notes present some properties of chordal graphs, a set of undirected
More informationBottleneck Steiner Tree with Bounded Number of Steiner Vertices
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash Paz Carmi Matthew J. Katz June 18, 2011 Abstract Given a complete graph G = (V, E), where each vertex is labeled either
More informationGraph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
More informationExercises: Disjoint Sets/ Union-find [updated Feb. 3]
Exercises: Disjoint Sets/ Union-find [updated Feb. 3] Questions 1) Suppose you have an implementation of union that is by-size and an implementation of find that does not use path compression. Give the
More informationGeneral Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs
General Models for Optimum Arbitrary-Dimension FPGA Switch Box Designs Hongbing Fan Dept. of omputer Science University of Victoria Victoria B anada V8W P6 Jiping Liu Dept. of Math. & omp. Sci. University
More informationAugmenting Trees so that Every Three Vertices Lie on a Cycle
Augmenting Trees so that Every Three Vertices Lie on a Cycle Peter Dankelmann School of Mathematical and Statistical Sciences, University of Natal, Durban, 4041, South Africa Wayne Goddard School of Geological
More informationarxiv:cs/ v1 [cs.ds] 20 Feb 2003
The Traveling Salesman Problem for Cubic Graphs David Eppstein School of Information & Computer Science University of California, Irvine Irvine, CA 92697-3425, USA eppstein@ics.uci.edu arxiv:cs/0302030v1
More informationSearch Trees. Undirected graph Directed graph Tree Binary search tree
Search Trees Undirected graph Directed graph Tree Binary search tree 1 Binary Search Tree Binary search key property: Let x be a node in a binary search tree. If y is a node in the left subtree of x, then
More informationA note on self complementary brittle and self complementary quasi chordal graphs
Applied and Computational Mathematics 2013; 2(3): 86-91 Published online July 20, 2013 (http://www.sciencepublishinggroup.com/j/acm) doi: 10.11648/j.acm.20130203.13 A note on self complementary brittle
More informationIsometric Diamond Subgraphs
Isometric Diamond Subgraphs David Eppstein Computer Science Department, University of California, Irvine eppstein@uci.edu Abstract. We test in polynomial time whether a graph embeds in a distancepreserving
More informationSection 5.5. Left subtree The left subtree of a vertex V on a binary tree is the graph formed by the left child L of V, the descendents
Section 5.5 Binary Tree A binary tree is a rooted tree in which each vertex has at most two children and each child is designated as being a left child or a right child. Thus, in a binary tree, each vertex
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationA General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors 1
Algorithmica (1997) 18: 544 559 Algorithmica 1997 Springer-Verlag New York Inc. A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic
More informationElements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
More informationarxiv: v2 [cs.dm] 28 Dec 2010
Multiple-source multiple-sink maximum flow in planar graphs Yahav Nussbaum arxiv:1012.4767v2 [cs.dm] 28 Dec 2010 Abstract In this paper we show an O(n 3/2 log 2 n) time algorithm for finding a maximum
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationAn undirected graph is a tree if and only of there is a unique simple path between any 2 of its vertices.
Trees Trees form the most widely used subclasses of graphs. In CS, we make extensive use of trees. Trees are useful in organizing and relating data in databases, file systems and other applications. Formal
More informationCharacterization of Networks Supporting Multi-dimensional Linear Interval Routing Scheme
Characterization of Networks Supporting Multi-dimensional Linear Interval Routing Scheme YASHAR GANJALI Department of Computer Science University of Waterloo Canada Abstract An Interval routing scheme
More information22 Elementary Graph Algorithms. There are two standard ways to represent a
VI Graph Algorithms Elementary Graph Algorithms Minimum Spanning Trees Single-Source Shortest Paths All-Pairs Shortest Paths 22 Elementary Graph Algorithms There are two standard ways to represent a graph
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More informationBinary Decision Diagrams
Logic and roof Hilary 2016 James Worrell Binary Decision Diagrams A propositional formula is determined up to logical equivalence by its truth table. If the formula has n variables then its truth table
More informationCS256 Applied Theory of Computation
CS256 Applied Theory of Computation Parallel Computation II John E Savage Overview Mesh-based architectures Hypercubes Embedding meshes in hypercubes Normal algorithms on hypercubes Summing and broadcasting
More informationFaster parameterized algorithm for Cluster Vertex Deletion
Faster parameterized algorithm for Cluster Vertex Deletion Dekel Tsur arxiv:1901.07609v1 [cs.ds] 22 Jan 2019 Abstract In the Cluster Vertex Deletion problem the input is a graph G and an integer k. The
More informationOptimal Parallel Randomized Renaming
Optimal Parallel Randomized Renaming Martin Farach S. Muthukrishnan September 11, 1995 Abstract We consider the Renaming Problem, a basic processing step in string algorithms, for which we give a simultaneously
More informationA TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX
A TIGHT BOUND ON THE LENGTH OF ODD CYCLES IN THE INCOMPATIBILITY GRAPH OF A NON-C1P MATRIX MEHRNOUSH MALEKESMAEILI, CEDRIC CHAUVE, AND TAMON STEPHEN Abstract. A binary matrix has the consecutive ones property
More informationGraph Algorithms Using Depth First Search
Graph Algorithms Using Depth First Search Analysis of Algorithms Week 8, Lecture 1 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Graph Algorithms Using Depth
More informationwhere is a constant, 0 < <. In other words, the ratio between the shortest and longest paths from a node to a leaf is at least. An BB-tree allows ecie
Maintaining -balanced Trees by Partial Rebuilding Arne Andersson Department of Computer Science Lund University Box 8 S-22 00 Lund Sweden Abstract The balance criterion dening the class of -balanced trees
More information