Web: http://arxiv.org/abs/2206.06924

June 17, 2022, 1:12 a.m. | Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho

cs.CL updates on arXiv.org arxiv.org

The Maximum Linear Arrangement problem (MaxLA) consists of finding a mapping
$\pi$ from the $n$ vertices of a graph $G$ to distinct consecutive integers
that maximizes $D_{\pi}(G)=\sum_{uv\in E(G)}|\pi(u) - \pi(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 …

arxiv linear trees

More from arxiv.org / cs.CL updates on arXiv.org

Machine Learning Researcher - Saalfeld Lab

@ Howard Hughes Medical Institute - Chevy Chase, MD | Ashburn, Virginia

Project Director, Machine Learning in US Health

@ ideas42.org | Remote, US

Data Science Intern

@ NannyML | Remote

Machine Learning Engineer NLP/Speech

@ Play.ht | Remote

Research Scientist, 3D Reconstruction

@ Yembo | Remote, US

Clinical Assistant or Associate Professor of Management Science and Systems

@ University at Buffalo | Buffalo, NY