Search Results for author:
Found 6 papers, 2 papers with code
The Maximum Linear Arrangement Problem for trees under projectivity and planarity
In the projective variant for rooted trees, arrangements have to be planar and the root of the tree cannot be covered by any edge.
The Linear Arrangement Library. A new tool for research on syntactic dependency structures
One of the main concerns in this field is the statistical patterns of syntactic dependency structures.
Minimum projective linearizations of trees in linear time
Gildea and Temperley (GT) sketched an algorithm for projective arrangements which they claimed runs in $O(n)$ but did not provide any justification of its cost.
The optimality of syntactic dependency distances
Here we recast the problem of the optimality of the word order of a sentence as an optimization problem on a spatial network where the vertices are words, arcs indicate syntactic dependencies and the space is defined by the linear order of the words in the sentence.
Bounds of the sum of edge lengths in linear arrangements of trees
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances.
