References
- Cornuéjols , G. , Naddef , D. and Pulleyblank , W. R. 1983 . Halin graphs and the travelling salesman problem . Math. Prog , 16 : 287 – 294 .
- Fulek , R. , He , H. , Sýkora , O. and Vrťo , I. 2005 . Outerplanar crossing numbers of 3-row meshes, Halin graphs and complete p-partite graphs , 376 – 379 . Springer . Proc. SOFSEM’05, LNCS 3381
- He , H. , Sýkora , O. and Mäkinen , E. 2007 . Genetic algorithms for the two-page book crossing number problem of graphs . J. Heurist , 13 : 77 – 93 .
- H. He, O. Sýkora, A.M. Sălăgean, and I. Vrťo, Various heuristic algorithms to minimise the two-page crossing numbers of graphs, the Journal of Heuristics, in review
- Masuda , S. , Kashiwabara , T. , Nakajima , K. and Fujisawa , T. NP-completeness of a computer network layout problem . Proc. IEEE Intl. Symposium on Circuits and Systems 1987 . Los Alamitos. pp. 292 – 295 . IEEE Computer Society Press .
- Masuda , S. , Nakajima , K. , Kashiwabara , T. and Fujisawa , T. 1990 . Crossing minimization in linear embeddings of graphs . IEEE Trans. Comput , 39 : 124 – 127 .
- Mead , C. and Conway , L. 1980 . “ Introduction to VLSI Systems ” . Reading, MA : Addison-Wesley .
- Shahrokhi , F. , Sýkora , O. , Székely , L. A. and Vrt'o , I. 1996 . The book crossing number of a graph . J. Graph Theory , 21 : 413 – 424 .
- Tougaw , P. and Lent , C. 1994 . Logical devices implemented using quantum cellular automata . J. Appl. Phys , 75 : 1818 – 1825 .
- Yang , Y. and Zhao , C. The crossing number of Cn(1, k) . Proc. National Symposium on Software Technology . pp. 134 – 136 . Chinese Computer Institute .