Date of Award
4-21-2009
Document Type
Thesis open access
Abstract
Determining whether a graph is planar is both theoretically and practically interesting. Although several sequential algorithms have been introduced which accomplish planarity testing in O(V ) time for graphs with V vertices, very few of these have been parallelized. In a recent comparison of sequential planarity testing algorithms, the newest algorithms were found to be fastest; however, these are the ones which have not been parallelized. The goal of this thesis is to introduce a method for parallelizing one of the newest planarity testing algorithms.
Recommended Citation
Ingram, Rebecca, "A New Parallel Algorithm for Planarity Testing" (2009). Computer Science Honors Theses. 24.
https://digitalcommons.trinity.edu/compsci_honors/24