This library implements several algorithms to solve problems related to linear arrangements. For example, it implements algorithms for
- solving the Minimum Linear Arrangement Problem on trees under different constraints of projectivity,
- the calculation of the expectation and variance of the number of edge crossings and of the sum of the length of the edges under different projectivity constraints,
- computing the number of edge crossings given a linear arrangement of a graph,
- and many others.
Some of the algorithms listed above are implemented for both general graphs and trees (the latter being more efficient). The library also provides functions for the generation of random/exhasutive labelled/unlabelled free/rooted trees. Besides, there's algorithms for the generation of arrangements under different constraints of projectivity. Users will also find utilities to process treebanks, and collection of treebanks.
For more information, visit LAL's official webpage. Do not forget to take a look at the guides!.
We wrote different sets of instructions for installing LAL's compiled distribution files for
- Ubuntu. We do not currently maintain any official repository for any of the Linux distributions' package manager.
- Windows.
We wrote different sets of instructions for compiling and installing LAL from sources for
See this file for instructions on how to compile and link a C++ program that uses LAL.
This library is the result of the joint effort of several people (in alphabetical order):
- Alemany-Puig, Lluís (see his webpage and his Research Gate profile).
- Esteban, Juan Luis (see his webpage and his Research Gate profile)
- Ferrer-i-Cancho, Ramon (see his webpage and his Research Gate profile).
In this library users will find implementations of papers written by the developers of LAL themselves, and implementations of algorithms devised by other researchers. This library is the result of a great effort put directly by the developers, and indirectly by other researchers. Besides citing the library in an academic paper, users must also acknowledge the effort made by other researchers by citing their papers in which they present the algorithms implemented in this library. Such papers are cited in the C++ documentation and can be found easily in the doxygen documentation. In case a citation is lacking, or is just incorrect, do not hesitate to contact us to inform us about this issue.
For now we do not have any formal publication of this library, so we do not have a preferred way of citing it. Please, contact any of the authors for further information about this matter.
The C++ documentation can be found online in the library's webpage. Alternatively, it can be generated in html format with doxygen. Simply issue the following command from the directory's root directory
$ ./make_docs.sh c++