Layout problems on lattice graphs

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

Volumn 1627, Issue , 1999, Pages 103-112

  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

COMBINATORIAL MATHEMATICS; SOLVENTS;

CONVERGENCE THEOREM; LATTICE GRAPHS; LAYOUT PROBLEMS; MINIMUM LINEAR ARRANGEMENT; OPTIMAL COSTS; RANDOM LATTICE; SITE PERCOLATION; UNDERLYING GRAPHS;

COMPUTATION THEORY;

EID: 4243743388     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48686-0_10     Document Type: Conference Paper

References (16)

1. S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graphs arrangements. In 37th IEEE Symposium on Foundations of Computer Science, 1996.
2. J. Beardwood, J. Halton, and J.M. Hammersley. The shortest path through many points. Proceedings of the Cambridge Philos. Society., 55:299-327, 1959.
3. K.L. Chung. A Course in Probability Theory. Academic Press, New York, 1974.
4. J. Dáz, M. D. Penrose, J. Petit, and M. Serna. Linear orderings of random geometric graphs. Technical report, Departament de Llenguatges i Sistemes Informàtics, UPC, http://www.lsi.upc.es/_jpetit/Publications, 1999.
5. J. Dáz. The δ-operator. In L. Budach, editor, Fundamentals of Computation Theory, pages 105-111. Akademie-Verlag, 1979.
6. N. Dunford and J. Schwartz. Linear Operators. Part I: General Theory. Interscience Publisher., New York, 1958.
7. S. Even and Y. Shiloach. NP-completeness of several arrangements problems. Technical report, TR-43 The Technion, Haifa, 1978.
8. G. Grimmett. Percolation. (2nd edition). Springer-Verlag, Heidelberg, 1999.
9. G. Mitchison and R. Durbin. Optimal numberings of an nn array. SIAM Journal on Discrete Mathematics, 7(4):571-582, 1986.
10. D.O. Muradyan and T.E. Piliposjan. Minimal numberings of vertices of a rectangular lattice. Akad. Nauk. Armjan. SRR, 1(70):21-27, 1980. In Russian.
11. K. Nakano. Linear layouts of generalized hypercubes. In J. van Leewen, editor, Graph-theoretic concepts in computer science, volume 790 of Lecture Notes in Computer Science, pages 364-375. Springer-Verlag, 1993.
12. C. H. Papadimitriou and M. Sideri. The bisection width of grid graphs. In First ACM-SIAM Symp. on Discrete Algorithms., pages 405-410, San Francisco, 1990.
13. M.D. Penrose. Vertex ordering and partition problems for random spatial graphs. Technical report, University of Durham, 1999.
14. J. Petit i Silvestre. 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.
15. J. Petit i Silvestre. Approximation Heuristics and Benchmarkings for the MinLA Problem. In Roberto Battiti and Alan A Bertossi, editors, Alex '98 - Building bridges between theory and applications, http://www.lsi.upc.es/_jpetit/MinLA/Benchmark, February 1998. Università di Trento.
16. J.M. Steele. Probability theory and Combinatorial Optimization. SIAM CBMS- NSF Regional Conference Series in Applied Mathematics., 1997.