Crossing Minimisation Heuristics for 2-page Drawings

Electronic Notes in Discrete Mathematics

Volumn 22, Issue , 2005, Pages 527-534

  He, Hongmei ^a   Sýkora, Ondrej ^a   Vrt'o, Imrich ^b  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

^b INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

1 page crossing number; 2 page crossing number; 2 page drawing; book crossing number; Hamiltonian cycle

Indexed keywords

EID: 34047138533     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2005.06.088     Document Type: Article

References (13)

1. Baur M., and Brandes U. Crossing Reduction in Circular Layouts. Proc. 30th Intl. Workshop Graph-Theoretic Concepts in Computer-Science. (WG '04). LNCS 3353 (2004), Springer, Berlin 332-343
2. Cimikowski R. Algorithms for the fixed linear crossing number problem. Discrete Applied Mathematics 122 (2002) 93-115
3. He, H., Sýkora, O., New circular drawing algorihtms, in: Proc. ITAT'2004
4. Kainen P.C. The book thickness of a graph II. Congressus Numerantium 71 (1990) 121-132
5. Masuda S., Kashiwabara T., Nakajima K., and Fujisawa T. On the NP-completeness of a computer network layout problem. Proc. IEEE Intl. Symposium on Circuits and Systems 1987 (1987), IEEE Computer Society Press, Los Alamitos 292-295
6. Masuda S., Kashiwabara T., Nakajima K., and Fujisawa T. Crossing minimization in linear embeddings of graphs. IEEE Trans. Comput. 39 (1990) 124-127
7. Mäkinen E. On circular layouts. International Journal of Computer Mathematics 24 (1988) 29-37
8. Melikov A.N., Koreičik V.M., and Tiščenko V.A. Minimization of the number of intersections of edges of a graph (Russian). Vyčisl. Sistemy Vyp. 47 (1971) 32-40
9. Nicholson T.A.J. Permutation procedure for minimazing the number of crossings in a network. Proc. Inst. Elec. Engnrs. 115 (1968) 21-26
10. Shahrokhi F., Sýkora O., Székely L.A., and Vrt'o I. The book crossing number of a graph. Journal of Graph Theory 21 (1996) 413-424
11. Shahrokhi F., Sýkora O., Székely L.A., and Vrt'o I. Towards the theory of convex crossing numbers. In: Pach J. (Ed). Towards a Theory of Geometric Graphs. Contemporary Mathematics Vol. 342 (2003), American Mathematical Society, Providence 249-258
12. Six J.M., and Tollis I.G. Circular drawings of biconnected graphs. ALENEX'99. LNCS 1619 (1999), Springer, Berlin 57-73
13. Winterbach, W., The crossing number of a graph in the plane, Master Thesis, Dept. Appl. Math., University of Stellenbosch, SA, 2005, 334 p