Minimum Linear Arrangement of Trees
| dc.contributor.advisor | Matthias F. M. Stallmann, Committee Chair | en_US |
| dc.contributor.advisor | Dennis Bahler, Committee Member | en_US |
| dc.contributor.advisor | Carla Savage, Committee Member | en_US |
| dc.contributor.author | Hochberg, Robert | en_US |
| dc.date.accessioned | 2010-04-02T18:16:20Z | |
| dc.date.available | 2010-04-02T18:16:20Z | |
| dc.date.issued | 2002-09-12 | en_US |
| dc.degree.discipline | Computer Science | en_US |
| dc.degree.level | thesis | en_US |
| dc.degree.name | MS | en_US |
| dc.description.abstract | In the minimum linear arrangement problem one is given a graph, and wishes to assign distinct integers to the vertices of the graph so that the sum of the differences (in absolute value) across the edges of the graph is minimized. This problem is known to be NP-complete for the class of all graphs, but polynomial for special classes of graphs, one of which is the class of trees. For trees on n vertices, algorithms of time complexity O(n2.2) and O(n1.6) were given by Shiloach in 1979 and Chung in 1983 respectively, with no improvement since then. In this thesis, we present a linear-time algorithm for finding the optimal embedding among those embeddings which have no "crossings," and we describe a C++ implementation of that algorithm as well as Shiloach's algorithm which we make available to the research community. | en_US |
| dc.identifier.other | etd-06112002-143058 | en_US |
| dc.identifier.uri | http://www.lib.ncsu.edu/resolver/1840.16/2659 | |
| dc.rights | I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report. | en_US |
| dc.subject | Graph Theory | en_US |
| dc.subject | Trees | en_US |
| dc.subject | Combinatorics | en_US |
| dc.subject | Algorithms | en_US |
| dc.title | Minimum Linear Arrangement of Trees | en_US |
Files
Original bundle
1 - 1 of 1
