Name
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. |
Year | Venue | Keywords |
|---|---|---|
1998 | RANDOM | open problem,minimal linear arrangement,random geometric problems,random geometric model,geometric model |
Field | DocType | ISBN |
Graph theory,Combinatorics,Search algorithm,Random graph,Spatial network,Computer science,Euclidean space,Heuristics,Statistical model,Computational complexity theory | Conference | 3-540-65142-X |
Citations | PageRank | References |
14 | 0.95 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Josep Díaz | 1 | 489 | 204.59 |
| Jordi Petit | 2 | 425 | 26.36 |
| Maria J. Serna | 3 | 473 | 70.53 |