research
∙
07/12/2022
Linear-time calculation of the expected sum of edge lengths in planar linearizations of trees
Dependency graphs have proven to be a very successful model to represent...
share
research
∙
06/14/2022
The Maximum Linear Arrangement Problem for trees under projectivity and planarity
The Maximum Linear Arrangement problem (MaxLA) consists of finding a map...
research
∙
12/05/2021
The Linear Arrangement Library. A new tool for research on syntactic dependency structures
The new and growing field of Quantitative Dependency Syntax has emerged ...
research
∙
07/07/2021
Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees
The syntactic structure of a sentence is often represented using syntact...
research
∙
02/05/2021
Minimum projective linearizations of trees in linear time
The minimum linear arrangement problem (MLA) consists of finding a mappi...
research
∙
07/30/2020
The optimality of syntactic dependency distances
It is often stated that human languages, as other biological systems, ar...
research
∙
03/06/2020
Reappraising the distribution of the number of edge crossings of graphs on a sphere
Many real transportation and mobility networks have their vertices place...
research
∙
03/06/2020
Fast calculation of the variance of edge crossings in random linear arrangements
The interest in spatial networks where vertices are embedded in a one-di...
research
∙
10/09/2019