• The scaling of the minimum sum of edge lengths in uniformly random trees 

      Esteban, Juan Luis; Ferrer-i-Cancho, Ramon; Gómez-Rodríguez, Carlos (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 ...