Master of Science (MS)
First Committee Member
Number of Pages
This thesis presents two algorithms dealing with problems in two classic algorithm areas in computer science. The first algorithm presents a simple solution to the selection problem. The sequential computing model form of this selection algorithm is presented first followed by a general parallel computing model version; The second algorithm is a relatively simple bookkeeping approximation solution to the Steiner tree problem in graphs. The problem presented deals with determining the shortest tree connecting Steiner nodes in a graph that has no direct connections between the Steiner nodes. Both algorithms are described and analyzed in detail with an appropriate running example to illustrate the actions of the algorithms.
Algorithms; Classical; Computer; Problems; Science; Two
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to firstname.lastname@example.org and include clear identification of the work, preferably with URL.
Howe, John Gerard, "Two new algorithms for classical problems in computer science" (2000). UNLV Retrospective Theses & Dissertations. 1205.
IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/