Linear Orderings of Random Geometric Graphs
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 of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cut, Minimum Sum Cut, Vertex Separation and Bisection. We first prove that some of these problems remain NP-complete even for geometric graphs. Afterwards, we compute lower bounds that hold with high probability on random geometric graphs. Finally, we characterize the probabilistic behavior of the lexicographic ordering for our layout problems on the class of random geometric graphs.
KeywordsLinear Ordering Random Graph Layout Problem Geometric Graph Grid Graph
Unable to display preview. Download preview PDF.
- 2.M. J. Appel and R. P. Russo. The connectivity of a graph on uniform points in [0, 1]d. Technical Report #275, Department of Statistics and Actuarial Science, University of Iowa, 1996. 294Google Scholar
- 5.R. Boppana. Eigenvalues and graph bisection: An average case analysis. In Proc. on Foundations of Computer Science, pages 280–285, 1987. 292Google Scholar
- 7.Josep Díaz, Mathew D. Penrose, Jordi Petit, and María Serna. Layout problems on lattice graphs. In T. Asano, H. Imai, D.T. Lee, S. Nakano, and T. Tokuyama, editors, Computing and Combinatorics-5th Annual International Conference, COCOON’99, Tokyo, Japan, July 26-28, 1999, number 1627 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, July 1999. 301Google Scholar
- 8.J. Díaz, J. Petit, M. Serna, and L. Trevisan. Approximating layout problems on random sparse graphs. Technical Report LSI 98-44-R, Universitat Polit`ecnica de Catalunya, 1998. 292Google Scholar
- 9.M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979. 293Google Scholar
- 10.F. Gavril. Some NP-complete problems on graphs. In Proc. 11th. Conference on Information Sciences and Systems, pages 91–95, John Hopkins Univ., Baltimore, 1977. 293Google Scholar
- 12.K. Lang and S. Rao. Finding Near-Optimal Cuts: An Empirical Evaluation. In Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 212–221, 1993. 292Google Scholar
- 15.C. H. Papadimitriou and M. Sideri. The bisection width of grid graphs. In First ACM-SIAM Symposium on Discrete Algorithms, pages 405–410, San Francisco, 1990. 295Google Scholar
- 17.J. Petit. Combining Spectral Sequencing with Simulated Annealing for the MinLA Problem: Sequential and Parallel Heuristics. Technical Report LSI-97-46-R, Departament de Llenguatges i Sistemes Informàtics, Universitat Polit`ecnica de Catalunya, 1997. 291Google Scholar
- 18.J. Petit. Approximation Heuristics and Benchmarkings for the MinLA Problem. In R. Battiti and A. Bertossi, editors, Alex’ 98-Building bridges between theory and applications, http://www.lsi.upc.es/?jpetit/MinLA/Benchmark, February 1998. Universit`a di Trento. 291, 292