Abstract
In this paper we survey the work done for graphs on random geometric models. We present some heuristics for the problem of the Minimal linear arrangement on [0; 1]2 and we conclude with a collection of open problems.
Cite
CITATION STYLE
APA
Díaz, J., Petit, J., & Serna, M. (1998). Random geometric problems on [0; 1]2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1518, pp. 294–306). Springer Verlag. https://doi.org/10.1007/3-540-49543-6_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free