Spelling suggestions: "subject:"trees inn graph theory"" "subject:"trees iin graph theory""
1 |
Efficient Parallel Algorithms and Data Structures Related to TreesChen, Calvin Ching-Yuen 12 1900 (has links)
The main contribution of this dissertation proposes a new paradigm, called the parentheses matching paradigm. It claims that this paradigm is well suited for designing efficient parallel algorithms for a broad class of nonnumeric problems. To demonstrate its applicability, we present three cost-optimal parallel algorithms for breadth-first traversal of general trees, sorting a special class of integers, and coloring an interval graph with the minimum number of colors.
|
Page generated in 0.0606 seconds