Linear orderings of random geometric graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1665, Issue , 1999, Pages 291-302

  Díaz, Josep ^a   Penrose, Mathew D ^b   Petit, Jordi ^a   Serna, María ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; GRAPHIC METHODS; SET THEORY;

GEOMETRIC GRAPHS; HIGH PROBABILITY; LEXICOGRAPHIC ORDER; LINEAR ORDERINGS; MINIMUM LINEAR ARRANGEMENT; PROBABILISTIC BEHAVIOR; RANDOM GEOMETRIC GRAPHS; RANDOMLY DISTRIBUTED;

GRAPH THEORY;

EID: 26344437166     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46784-x_28     Document Type: Conference Paper

References (19)

1. N. Alon, J. H. Spencer, and P. Erdős. The probabilistic method. Wiley-Interscience, New York, 1992. 292
2. d. Technical Report #275, Department of Statistics and Actuarial Science, University of Iowa, 1996. 294
3. J.E. Atkins, E.G. Boman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput., 28(1):297-310, 1999. 291
4. S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28:300-343, 1984. 291
5. R. Boppana. Eigenvalues and graph bisection: An average case analysis. In Proc. on Foundations of Computer Science, pages 280-285, 1987. 292
6. T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica, 7:171-191, 1987. 292
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. 301
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ècnica de Catalunya, 1998. 292
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979. 293
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. 293
11. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Operations Research, 37(6):865-892, November 1989. 292
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. 292
13. T. Lengauer. Black-white pebbles and graph separation. Acta Informatica, 16:465-475, 1981. 293
14. G. Mitchison and R. Durbin. Optimal numberings of an n×n array. SIAM Journal on Discrete Mathematics, 7(4):571-582, 1986. 291
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. 295
16. M. D. Penrose. The longest edge of the random minimal spanning tree. The Annals of Applied Probability, 7:340-361, 1997. 292
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ècnica de Catalunya, 1997. 291
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à di Trento. 291, 292
19. J. S. Turner. On the probable performance of heuristics for bandwidth minimization. SIAM Journal on Computing, 15:561-580, 1986. 291, 292