Crossing numbers of meshes

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

Volumn 1027, Issue , 1996, Pages 463-471

  Shahrokhi, Farhad ^a   Sýkora, Ondrej ^b   Székely, László A ^c   Vrt’o, Imrich ^b  

^a UNIVERSITY OF NORTH TEXAS   (United States)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CARTESIAN PRODUCTS; CROSSING NUMBER; LOWER AND UPPER BOUNDS; LOWER BOUNDS; SCHWENK; UPPER BOUND;

DRAWING (GRAPHICS);

EID: 33744711745     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021830     Document Type: Conference Paper

References (22)

1. L. W. Beineke, R. D. Ringeisen, On the crossing number of product of cycles and graphs of order four, J. Graph Theory 4 (1980), 145-155.
2. M. Hall, Jr., Combinatorial Theory, Blaisdell Publ. Co., Waltham, 1967.
3. F. Harary, P. C. Kainen, A. Schwenk, Toroidal graphs with arbitrary high crossing numbers, Nanta Mathematica 6 (1973), 58-67.
4. n, Časopis pro Pestování Matematiky 107 (1982), 225-230.
5. p,q, and Q(d), J. Combinatorial Theory, Series B 12 (1972), 287-298.
6. 5,n, J. Combinatorial Theory 9(1970), 315-323.
7. M. Klešč, On the crossing number of the cartesian product of stars and paths or cycles, Mathematica Slovaca 41 (1991), 113-120.
8. M. Klešč, The crossing number of product of path and stars with 4-vertex graphs, J. Graph Theory 18 (1994), 605-614.
9. M. Klešč, On the crossing numbers of products of cycles, preprint.
10. D. Larman, J. Matoušek, J. Pach, J. Töröcsik, A Ramsey-type result for planar convex sets, to appear.
11. F. T. Leighton, Complexity Issues in VLSI, MIT Press, Cambridge, 1983.
12. F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays.Trees.Hypercubes, Morgan Kaufmann, San Mateo, 1992.
13. J. Pach, J. Töröcsik, Some geometric applications of Dilworth' theorem, Discrete Computational Geometry, 21(1994), 1-7.
14. n, preprint.
15. R. B. Richter, C. Thomassen, Intersection of curve systems and the crossing number of Cs × Cs, Discrete and Computational Geometry 13 (1995), 149-159.
16. n J. Combinnatorial Theory, Series B 24 (1978), 134-144.
17. F. Shahrokhi, L. A. Székely, An algebraic approach to the uniform concurrent multicommodity flow problem: theory and applications, Technical Report CRPDC- 91-4, Department of Computer Science, University of North Texas, Denton, 1991.
18. F. Shahrokhi, L. A. Székely, Effective lower bounds for crossing number, bisection width and balanced vertex separators in terms of symmetry, in: Proc. 2-nd IPCO Conference, Pittsburgh, 1992, 102-113, also in Combinatorics, Probability and Computing 3 (1994), 523-543.
19. F. Shahrokhi, L. A. Székely, I. Vrt'o, Crossing numbers of graphs, lower bound techniques and algorithms: a survey, in: Proc. DIMACS Workshop on Graph Drawing'94, Lecture Notes in Computer Science 894, Springer Verlag, Berlin, 1995, 131-142.
20. O. Sýkora and I. Vrt'o, On the crossing number of hypercubes and cube connected cycles, BIT 33 (1993), 232-237.
21. A. T. White, L. W. Beineke, Topological graph theory, in: Selected Topics in Graph Theory, (L.W. Beineke R.J. Wilson, eds.), Academic Press, N.Y., 1978, 15-50.
22. K. Wada, K. Kawaguchi, H. Suzuki, Optimal bounds of the crossing number and the bisection width for generalized hypercube graphs, in: Proc. 16th Biennial Symposium on Communications, 1992, 323-326.