Crossing number, pair-crossing number, and expansion

Journal of Combinatorial Theory. Series B

Volumn 92, Issue 1, 2004, Pages 99-113

  Kolman, Petr ^a   Matoušek, Jiří ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

Crossing number; Expansion; Graph drawing; Pair crossing number

Indexed keywords

EID: 4344615249     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jctb.2003.09.002     Document Type: Article

References (22)

1. Ajtai M. Chvátal V. Newborn M. Szemerédi E. Crossing-free subgraphs Ann. Discrete Math. 12 1982 9-12
2. Arora S. Rao S. Vazirani U. Expander flows, geometric embeddings, and graph partitionings, in: Proceedings of the 36th ACM Symposium on Theory of Computing, 2004.
3. Bhatt S.N. Leighton F.T. A framework for solving VLSI graph layout problems J. Comput. System Sci. 28 1984 300-343
4. Even G. Guha S. Schieber B. Improved approximations of crossings in graph drawings SIAM J. Comput. 32 1 2003 231-252
5. Kolman P. Scheideler C. Improved bounds for the unsplittable flow problem, in: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002, pp. 184-193.
6. Kratochvíl J. Matoušek J. Intersection graphs of segments J. Combin. Theory Ser. B 35 2 1994 317-339
7. Leighton F.T. Complexity issues in VLSI 1983 MIT Press Cambridge, MA
8. Leighton F.T. New lower bound techniques for VLSI Math. Systems Theory 17 1984 47-70
9. Leighton F.T. Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms J. Assoc. Comput. Mach. 46 1999 787-832
10. Mohar B. Thomassen C. Graphs on Surfaces 2001 Johns Hopkins University Press Baltimore, MD
11. Pach J. Shahrokhi F. Szegedy M. Applications of the crossing number Algorithmica 16 1996 111-117 (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia)
12. Pach J. Tóth G. Thirteen problems on crossing numbers Geombinatorics 9 2000 194-207
13. Pach J. Tóth G. Which crossing number is it anyway? J. Combin. Theory Ser. B 80 2000 225-246
14. Pach J. Tóth G. Disjoint edges in topological graphs, in: Proceedings of Indonesia-Japan Conference on Combinatorial Geometry and Graph Theory, 2003
15. Raghavan P. Thompson C.D. Randomized rounding: A technique for provably good algorithms and algorithmic proofs Combinatorica 7 1987 365-374
16. Shahrokhi F. Sýkora O. Székely I. Vrt'o, Bounds for convex crossing numbers, in: COCOON Annual International Conference on Computing and Combinatorics, 2003, pp. 487-495.
17. Shahrokhi F. Sýkora O. A. Székely L. Vrt'o I. Crossing numbers: bounds and applications In: Bárány I. Böröczky K. (Eds.) Intuitive Geometry Bólyai Society Mathematical Studies Vol. 6 1997 179-206 Akadémiai Kiadó Budapest
18. Shahrokhi F. Székely L. Sýkora O. Vrt'o I. The book crossing number of a graph J. Graph Theory 21 4 1996 413-424
19. Spencer J. Tóth G. Crossing numbers of random graphs Random Structures and Algorithms 21 3-4 2002 347-358
20. Sýkora O. Vrt'o I. On VLSI layouts of the star graph and related networks Integration, VLSI J. 17 1 1994 83-93
21. Tutte W.T. Toward a theory of crossing numbers J. Combin. Theory 8 1970 45-53
22. Valtr P. 2002, Personal communication.