Buscar
Mostrando ítems 1-2 de 2
The scaling of the minimum sum of edge lengths in uniformly random trees
(2016-06)
[Abstract] The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this ...
Liberating language research from dogmas of the 20th century
(2016)
[Abstract] A commentary on the article “Large -scale evidence of dependency length minimization in 37 languages” by Futrell, Mahowald & Gibson (PNAS 2015 112 (33) 10336-10341).