Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs

@article{Daz2000ConvergenceTF,
  title={Convergence Theorems For Some Layout Measures On Random Lattice And Random Geometric Graphs},
  author={Josep D{\'i}az and Mathew D. Penrose and Jordi Petit and Maria J. Serna},
  journal={Combinatorics, Probability & Computing},
  year={2000},
  volume={9},
  pages={489-511}
}
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. Specifically, we consider the following problems: Minimum Linear Arrangement, Cutwidth, Sum Cut, Vertex Separation, Edge Bisection and Vertex Bisection. For full square lattices, we give… CONTINUE READING

2 Figures & Tables

Topics

Statistics

05'03'05'07'09'11'13'15'17
Citations per Year

fewer than 50 Citations

Semantic Scholar estimates that this publication has 50 citations based on the available data.

See our FAQ for additional information.