Parallel techniques for construction of trees and related problems
The concept of a tree has been used in various areas of mathematics for over a century. In particular, trees appear to be one of the most fundamental notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods...
Main Author: | Przytycka, Teresa Maria |
---|---|
Language: | English |
Published: |
University of British Columbia
2011
|
Subjects: | |
Online Access: | http://hdl.handle.net/2429/30640 |
Similar Items
-
Minimal congestion trees
by: Dawson, Shelly Jean
Published: (2006) -
Tree Graphs and Orthogonal Spanning Tree Decompositions
by: Mahoney, James Raymond
Published: (2016) -
The Isoperimetric Problem On Trees And Bounded Tree Width Graphs
by: Bharadwaj, Subramanya B V
Published: (2010) -
Efficient Parallel Algorithms and Data Structures Related to Trees
by: Chen, Calvin Ching-Yuen
Published: (1991) -
Combinatorics of oriented trees and tree-like structures
by: Okoth, Isaac Owino
Published: (2015)