[1]

A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley series in computer science and information processing. Addison-Wesley Publishing Company, Michigan University, 1st edition, 1974.

[2]

Lluís Alemany-Puig and Ramon Ferrer-i Cancho. Edge crossings in random linear arrangements. Journal of Statistical Mechanics, page In press, 2020.

[3]

Lluís Alemany-Puig and Ramon Ferrer-i Cancho. Fast calculation of the variance of edge crossings in random linear arrangements. page In prep, 2020.

[4]

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees. Arxiv, 2021.

[5]

Lluís Alemany-Puig and Ramon Ferrer-i-Cancho. Linear-time calculation of the expected sum of edge lengths in projective linearizations of trees. Arxiv, 2021.

[6]

Lluís Alemany-Puig, Juan Luis Esteban, and Ramon Ferrer-i-Cancho. Minimum projective linearizations of trees in linear time. Arxiv, 2021.

[7]

L. Alonso and R. Schott. Random generation of trees. Random generators in computer science. Springer, 1995.

[8]

Patrick Bennett, Sean English, and Maria Talanda-Fisher. Weighted turán problems with applications. Discrete Mathematics, 342(8):2165–2172, 2019.

[9]

Terry Beyer and Sandra Mitchell Hedetniemi. Constant time generation of rooted trees. SIAM Journal on Computing, 9(4):706–712, 1980.

[10]

F. R. K. Chung. On optimal linear arrangements of trees. Computers and Mathematics with Applications, 10(1):43–60, 1984.

[11]

Juan Luis Esteban and Ramon Ferrer-i Cancho. A correction on Shiloach's algorithm for minimum linear arrangements of trees. Society for Industrial and Applied Mathematics, 46(3):1146–1151, 2017.

[12]

Ramon Ferrer-i Cancho, Gómez-Rodríguez C., and Juan Luis Esteban. Are crossing dependencies really scarce? Physica A: Statistical Mechanics and its Applications, 493:311–329, 2018.

[13]

Ramon Ferrer-i Cancho. A stronger null hypothesis for crossing dependencies. CoRR, abs/1410.5485, 2014.

[14]

R. Futrell, K. Mahowald, and E. Gibson. Large-scale evidence of dependency length minimization in 37 languages. Proceedings of the National Academy of Sciences, 112(33):10336–10341, 2015.

[15]

Daniel Gildea and David Temperley. Optimizing grammars for minimum dependency length. In Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 184–191, Prague, Czech Republic, June 2007. Association for Computational Linguistics.

[16]

The gnu multiple precision arithmetic library. https://gmplib.org/. Accessed: 2020-03-24.

[17]

Carlos Gómez-Rodríguez, John Carroll, and David Weir. Dependency parsing schemata and mildly non-projective dependency parsing. Computational Linguistics, 37:541–586, 2011.

[18]

Frank Harary and Allen J. Schwenk. The number of caterpillars. Discrete Mathematics, 6:359–365, 1973.

[19]

Frank Harary. Graph Theory. CRC Press, Boca Raton, FL, USA, 2nd edition, 1969.

[20]

Robert A. Hochberg and Matthias F. Stallmann. Optimal one-page tree embeddings in linear time. Information Processing Letters, 87(2):59–66, 2003.

[21]

Ramon Ferrer i Cancho. The sum of edge lengths in random linear arrangements. Journal of Statistical Mechanics: Theory and Experiment, 2019:053401, 05 2019.

[22]

M. A. Iordanskii. Minimal numberings of the vertices of trees — approximate approach. In Lothar Budach, Rais Gatic Bukharajev, and Oleg Borisovic Lupanov, editors, Fundamentals of Computation Theory, pages 214–217, Berlin, Heidelberg, 1987. Springer Berlin Heidelberg.

[23]

Yingqi Jing and Haitao Liu. Mean Hierarchical Distance: Augmenting Mean Dependency Distance. Proceedings of the Third International Conference on Dependency Linguistics (Depling 2015), (Depling):161–170, 2015.

[24]

Sylvain Kahane, Chunxiao Yan, and Marie-Amélie Botalla. What are the limitations on the flux of syntactic dependencies? evidence from ud treebanks. pages 73–82, 9 2017.

[25]

H. Liu. Dependency direction as a means of word-order typology: a method based on dependency treebanks. Lingua, 120(6):1567–1578, 2010.

[26]

Luka Marohnić. Graph theory package for giac/xcas - reference manual. https://usermanual.wiki/Document/graphtheoryusermanual.346702481/view. Accessed: 2020-01-13.

[27]

Albert Nijenhuis and Herbert S. Wilf. Combinatorial Algorithms: For Computers and Hard Calculators. Academic Press, Inc., Orlando, FL, USA, 2nd edition, 1978.

[28]

Richard Otter. Annals of Mathematics The Number of Trees. 49(3):583–599, 1948.

[29]

H. Prüfer. Neuer Beweis eines Satzes über Permutationen. Arch. Math. Phys, 27:742–744, 1918.

[30]

Giorgio Satta, Emily Pitler, Sampath Kannan, and Mitchell Marcus. Finding optimal 1-endpoint-crossing trees. pages 13–24, 2013.

[31]

Yossi Shiloach. A minimum linear arrangement algorithm for undirected trees. Society for Industrial and Applied Mathematics, 8(1):15–32, 1979.

[32]

N. J. A. Sloane. The on-line encyclopedia of integer sequences - a000055 - number of trees with n unlabeled nodes. https://oeis.org/A000055. Accessed: 2019-12-28.

[33]

N. J. A. Sloane. The on-line encyclopedia of integer sequences - a000081 - number of unlabeled rooted trees with n nodes (or connected functions with a fixed point). https://oeis.org/A000081. Accessed: 2019-03-31.

[34]

H. S. Wilf. The uniform selection of free trees. Journal of Algorithms, 2:204–207, 1981.

[35]

Robert Alan Wright, Bruce Richmond, Andrew Odlyzko, and Brendan D McKay. Constant time generation of free trees. SIAM Journal on Computing, 15:540–548, 05 1986.