Planar crossing numbers of genus g graphs

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

Volumn 4051 LNCS, Issue , 2006, Pages 419-430

  Djidjev, Hristo ^a   Vrt'o, Imrich ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING; MATHEMATICAL MODELS; NUMERICAL METHODS;

CONSTANT; GENUS G; N-VERTEX GRAPH;

GRAPH THEORY;

EID: 33746364520     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_37     Document Type: Conference Paper

References (18)

1. M. Ajtai, V. Chvátal, M. M. Newborn, E. Szemerédy. Crossing-free subgraphs. Theory and Practice of Combinatorics, North Holland Mathematical Studies 60, Annals of Discrete Mathematics 12, North-Holland, Amsterdam, 1982, 9-12.
2. C. Buchheirn, D. Ebner, M. Jünger, G. W. Klau, P. Mutzel, R. Weiskircher. Exact crossing minimization. 13th Intl. Symposium on Graph Drawing, Lecture Notes in Computer Science, Springer, Berlin, 2006.
3. G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis. Graph Drawing: Algorithms for Visualization of Graphs. Prentice Hall, 1999.
4. R. Cimikowski. Algorithms for the fixed linear crossing number problem. Discrete Applied Mathematics 122:93-115, 2002.
5. H. N. Djidjev. A separator theorem. Compt. rend. Acad. bulg. Sci., 34:643-645, 1981.
6. H. N. Djidjev. Partitioning planar graphs with vertex costs: Algorithms and applications. Algorithmica, 28(1):51-75, 2000.
7. H. N. Djidjev, S. Venkatesan. Planarization of graphs embedded on surfaces. 21st International Workshop on Graph-Theoretic Concepts in Computer Science, pages 62-72, 1995.
8. G. Even, S. Guha, B. Schieber. Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Computing, 32(1): 231-252, 2002.
9. M. R. Garey, D. S. Johnson. Crossing number is NP-complete SIAM J. Algeraic and Discrete Methods, 1983:4, 312-316.
10. J. R. Gilbert, J. P. Hutchinson, R. E. Tarjan. A separator theorem for graphs of bounded genus. J. Algorithms, 5:391-407, 1984.
11. L.Y. Glebsky, G. Salazar. The crossing numbert of cr(Cm × Cn) is as conjectured for n ≥ m(m + 1). J. Graph Theory 47:53-72, 2004.
12. P. Hliněný. Crossing number is hard for cubic graphs. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 3153, Springer, Berlin, 772-782, 2004.
13. F.T. Leighton. Complexity Issues in VLSI. M.I.T. Press, Cambridge, 1983.
14. J. Pach, G. Tóth. Crossing number of toroidal graphs. 13th Intl. Symposium on Graph Drawing, Lecture Notes in Computer Science 3843, Springer, Berlin, 334-342, 2006.
15. J. Pach, F. Shahrokhi, M. Szegedy. Applications of the crossing number. Algorithmica, 16:111-117, 1996.
16. O. Sýkora, I. Vrt'o. Optimal VLSI Layouts of the star graph and related networks. Integration the VLSI Journal, 17:83-94, 1994.
17. O. Sýkora, I. Vrt'o. Edge separators for graphs of bounded genus with applications. Theoretical Computer Science, 112:419-429, 1993.
18. K. Zarankievicz. On a problem of P. Turán concerning graphs. Fund. Math., 41:137-145, 1954.