Date of Award


Document Type


Degree Name

Master of Arts (MA)


Computer Science

First Advisor

Dr. Hesham H. Ali


Graph partitioning involves decomposing a relational graph into smaller graphs, subject to domain-specific parameters and constraints. There are a number of application areas to include database querying, map coloring, cob allocation, VLSI design, and parallel processing. The primary goal is to unify a portion of these concepts allowing discussion and execution at a more common and abstract level. There are many facets to graph partitioning. Typical areas include the number of partitions, the size of a partition, number of inter-partition connections, and the amount of replication involved. These and many other factors must be considered when generating a partitioning algorithm. We propose an abstract graph partitioning model, the AGPM.


A Thesis Presented to the Department of Computer Science and the Faculty of the Graduate College University of Nebraska In Partial Fulfillment of the Requirements for the Degree Master of Arts University of Nebraska at Omaha. Copyright 2000 Christopher J. Augeri

Files over 3MB may be slow to open. For best results, right-click and select "save as..."