Random geometric problems on $[0,1]^2$
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.
| Autores: | , , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 1998 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/84546 |
| Acceso en línea: | https://hdl.handle.net/2117/84546 |
| Access Level: | acceso abierto |
| Palabra clave: | Graphs Random geometric models Minimal linear arrangement Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Sumario: | 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. |
|---|