The Maximum Linear Arrangement Problem for trees under projectivity and planarity

by   Lluís Alemany-Puig, et al.

The Maximum Linear Arrangement problem (MaxLA) consists of finding a mapping π from the n vertices of a graph G to distinct consecutive integers that maximizes D_π(G)=∑_uv∈ E(G)|π(u) - π(v)|. In this setting, vertices are considered to lie on a horizontal line and edges are drawn as semicircles above the line. There exist variants of MaxLA in which the arrangements are constrained. In the planar variant edge crossings are forbidden. In the projective variant for rooted trees arrangements are planar and the root cannot be covered by any edge. Here we present O(n)-time and O(n)-space algorithms that solve Planar and Projective MaxLA for trees. We also prove several properties of maximum projective and planar arrangements.


page 1

page 2

page 3

page 4


Separators for Planar Graphs that are Almost Trees

We prove that a connected planar graph with n vertices and n+μ edges has...

Minimum projective linearizations of trees in linear time

The minimum linear arrangement problem (MLA) consists of finding a mappi...

Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees

Dependency graphs have proven to be a very successful model to represent...

How to Morph a Tree on a Small Grid

In this paper we study planar morphs between straight-line planar grid d...

The variation of the sum of edge lengths in linear arrangements of trees

A fundamental problem in network science is the normalization of the top...

Max-flow vitality in undirected unweighted planar graphs

We show a fast algorithm for determining the set of relevant edges in a ...

A graph theoretical approach to the firebreak locating problem

In the last decade, wildfires have become wider and more destructive. Th...

Please sign up or login with your details

Forgot password? Click here to reset