Linear arrangement of Halin graphs
Permanent Link
http://hdl.handle.net/2144/21776Citation
Kfoury, Assaf; Mirzaei, Saber. Linear Arrangement of Halin Graphs. Technical Report BU-CS-TR 2015-012, Computer Science Department, Boston University, September 1, 2015.Abstract
We study the Optimal Linear Arrangement (OLA) problem of Halin graphs, one of the simplest classes of non-outerplanar graphs. We present several properties of OLA of general Halin graphs. We prove a lower bound on the cost of OLA of any Halin graph, and define classes of Halin graphs for which the cost of OLA matches this lower bound. We show for these classes of Halin graphs, OLA can be computed in nlog n, where n is the number of vertices.