28 citations · 104 across the 8 of their papers we have counts for
4 papers · 1 filter
Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
Linear arrangements of graphs are a well-known type of graph labeling and are found in many important computational problems. A linear arrangement is usually defined as a permutati…
The Maximum Linear Arrangement Problem for trees under projectivity and planarity
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
A linear arrangement is a mapping from the vertices of a graph to distinct consecutive integers. Linear arrangements can be represented by drawing the vertices alon…
Minimum projective linearizations of trees in linear time
Lluís Alemany-Puig, Juan Luis Esteban, Ramon Ferrer-i-Cancho
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping from vertices of a graph to distinct integers that minimizes . In t…
A correction on Shiloach's algorithm for minimum linear arrangement of trees
Juan Luis Esteban, Ramon Ferrer-i-Cancho
More than 30 years ago, Shiloach published an algorithm to solve the minimum linear arrangement problem for undirected trees. Here we fix a small error in the original version of t…