Now showing items 1-2 of 2

  • Convergence theorems for some layout measures on random lattice and random geometric graphs 

    Díaz Cort, Josep; Penrose, Matthew; Petit Silvestre, Jordi; Serna Iglesias, María José (1999-04)
    External research report
    Open Access
    This work deals with convergence theorems and bounds on the cost of several layout measures for lattice graphs, random lattice graphs and sparse random geometric graphs. For full square lattices, we give optimal layouts ...
  • Linear orderings of random geometric graphs (extended abstract) 

    Díaz Cort, Josep; Penrose, Matthew; Petit Silvestre, Jordi; Serna Iglesias, María José (1999-04)
    External research report
    Open Access
    In random geometric graphs, vertices are randomly distributed on [0,1]^2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices ...