Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs
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 . …