Minimum Linear Arrangement of Trees

Graph Theory;Trees;Combinatorics;Algorithms

Hochberg, Robert ; Matthias F. M. Stallmann, Committee Chair,Dennis Bahler, Committee Member,Carla Savage, Committee Member,Hochberg, Robert ; Matthias F. M. Stallmann ; Committee Chair ; Dennis Bahler ; Committee Member ; Carla Savage ; Committee Member

University:North Carolina State University

关键词: Graph Theory;    Trees;    Combinatorics;    Algorithms;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/2659/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

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.