Loading...
Loading...

Go to the content (press return)

Random geometric problems on $[0,1]^2$

Author
Diaz, J.; Petit, J.; Serna, M.
Type of activity
Report
Date
1998-09
Code
R98-47
Repository
http://hdl.handle.net/2117/84546 Open in new window
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. 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.
Citation
Diaz, J., Petit, J., Serna, M. "Random geometric problems on $[0,1]^2$". 1998.
Keywords
Graphs, Minimal linear arrangement, Random geometric models
Group of research
ALBCOM - Algorithms, Computational Biology, Complexity and Formal Methods

Participants

Attachments