3 citations · 3 across the 1 of their papers we have counts for
4 papers
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 optimality of word lengths. Theoretical foundations and an empirical study
Sonia Petrini, Antoni Casas-i-Muñoz, Jordi Cluet-i-Martinell +3
Zipf's law of abbreviation, namely the tendency of more frequent words to be shorter, has been viewed as a manifestation of compression, i.e. the minimization of the length of form…
The distribution of syntactic dependency distances
Sonia Petrini, Ramon Ferrer-i-Cancho
The syntactic structure of a sentence can be represented as a graph, where vertices are words and edges indicate syntactic dependencies between them. In this setting, the distance…
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 . I…