Algorithms for the fixed linear crossing number problem

Discrete Applied Mathematics

Volumn 122, Issue 1-3, 2002, Pages 93-115

  Cimikowski, Robert ^a  

^a Idaho National Laboratory   (United States)

Author keywords

Branch and bound; Crossing number; Heuristic; Linear layout; Neural network

Indexed keywords

EID: 84867936858     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00314-6     Document Type: Article

References (53)

1. J.-C. Bermond, and C. Peyrat De Bruijn and Kautz networks: a competitor for the hypercube? F. Andre, J.P. Verjus, Hypercube and Distributed Computers 1989 Elsevier Amsterdam
2. F. Bernhart, and P.C. Kainen The book thickness of a graph J. Combin. Theory Ser. B 27 1979 320 331
3. S.N. Bhatt, and F.T. Leighton A framework for solving VLSI graph layout problems J. Comput. Systems Sci. 28 1984 300 343
4. T. Bilski Embedding graphs in books: a survey IEE Proc. E 139 2 1992 134 138
5. F. Boesch, and R. Tindell Circulants and their connectivities J. Graph Theory 8 1984 487 499
6. B. Bollobás Random Graphs 1985 Academic Press New York
7. F.B. Chedid, and R.B. Chedid A new variation on hypercubes with smaller diameter Inform. Proc. Lett. 46 1993 275 280
8. P.Z. Chinn, L. Chvátalová, A.K. Dewdney, and N.E. Gibbs The bandwidth problem for graphs and matrices - a survey J. Graph Theory 6 1982 223 253
9. F.R.K. Chung, F.T. Leighton, and A.L. Rosenberg Embedding graphs in books: a layout problem with applications to VLSI design SIAM J. Algebra Discrete Methods 8 1987 33 58
10. R. Cimikowski Topological properties of some interconnection network graphs Congr. Numer. 121 1996 19 32
11. R. Cimikowski, and P. Shope A neural network algorithm for a graph layout problem IEEE Trans. Neural Networks 7 2 1996 341 345
12. N.G. de Bruijn A combinatorial problem Nederl. Akad. Wetensch. Proc. Ser. A. 49 1946 758 764
13. E. Damiani, and O. D'Antonia An upper bound to the crossing number of the complete graph drawn on the pages of a book J. Combin. Inform. System Sci. 19 1-2 1994 75 84
14. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis Algorithms for drawing graphs: an annotated bibliography Comput. Geom. 4 1994 235 282
15. G. Di Battista, G. Liotta, A. Garg, E. Tassinari, R. Tamassia, and F. Vargiu An experimental comparison of four graph drawing algorithms Comput. Geom. 7 5,6 1997 303 325
16. S.K. Das, A. Mao, A theoretical network model and the Hamming cube networks, Proceedings of the Eigth International IEEE Parallel Processing Symposium, Cancun, Mexico, 1996, pp. 18-22.
17. P. Eades, and D. Kelly Heuristics for reducing crossings in 2-layered networks Ars Combin. 21-A 1986 89 98
18. K. Efe The crossed cube architecture for parallel computation IEEE Trans. Parallel & Distrib. Systems 3 5 1992 513 524
19. A. El-Amawy, and S. Latifi Properties and performance of folded hypercubes IEEE Trans. Parallel & Distrib. Systems 2 1 1991 31 42
20. L. Faria, and C.M.H. de Figueiredo On the Eggleton and Guy conjectured upper bound for the crossing number of the n-cube Math. Slovaca 50 2000 271 287
21. R.S. Gilbert, W.K. Kleinöder, CNMgraf - graphic presentation services for network management, Proceedings of the Nineth Symposium on Data Communication, Vancouver, BC, Canada, 1985, pp. 199-206.
22. R.K. Guy Crossing number of graphs, Graph Theory and Applications 1972 Springer NY
23. R.K. Guy Latest results on crossing numbers, Recent Trends in Graph Theory 1971 Springer NY
24. R.K. Guy, T. Jenkyns, and J. Schaer The toroidal crossing number of the complete graph J. Combin. Theory 4 1968 376 390
25. F. Harary, P.C. Kainen, and A.J. Schwenk Toroidal graphs with arbitrarily high crossing numbers Nanta Math. 6 1973 58 67
26. T. Hasunuma, and Y. Shibata Embedding de Bruijn, Kautz and shuffle-exchange networks in books Discrete Appl. Math. 78 1997 103 116
27. J. Hopfield, and D. Tank Neural computation of decisions in optimization problems Biol. Cybernet. 52 1985 141 152
28. M. Jünger, and P. Mutzel 2-layer straightline crossing minimization: performance of exact and heuristic algorithms J. Graph Algorithms Appl. 1 1 1997 1 25
29. P.C. Kainen The book thickness of a graph, II Congr. Numer. 71 1990 127 132
30. F.T. Leighton Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes 1992 Morgan Kaufmann San Mateo, CA
31. T. Madej Bounds for the crossing number of the n-cube J. Graph Theory 15 1991 81 97
32. S.M. Malitz On the page number of graphs J. Algorithms 17 1 1994 71 84
33. S. Masuda, K. Nakajima, T. Kashiwabara, and T. Fujisawa Crossing minimization in linear embeddings of graphs IEEE Trans. Comput. 39 1 1990 124 127
34. W.S. McCulloch, and W.H. Pitts A logical calculus of ideas imminent in nervous activity Bull. Math. Biophys. 5 1943 115 133
35. T.A.J. Nicholson Permutation procedure for minimising the number of crossings in a network Proc. IEE 115 1 1968 21 26
36. F.P. Preparata, and J. Vuillemin The cube-connected cycles: a versatile network for parallel computation Comm. ACM 24 5 1981 300 309
37. R. Raghavan, and S. Sahni Single row routing IEEE Trans. Comput. C-32 3 1983 209 220
38. M. Ringenburg, Using simulated annealing to find crossing numbers, (www.dartmouth.edu/mfr/xnum.html).
39. A.L. Rosenberg The DIOGENES approach to testable fault-tolerant arrays of processors IEEE Trans. Comput. C-32 10 1983 902 910
40. F. Shahrokhi, O. Skora, L.A. Székely, and I. Vrto Crossing numbers: bounds and applications I. Barany, K. Boroczky, Intuitive Geometry Bolyai Soc. Math. Studies Vol. 6 1997 Akademia Kiado Budapest 179 206
41. A. Sen, A. Sengupta, S. Bandyopadhyay, On some topological properties of hypercubes, incomplete hypercubes, and supercubes, Proceedings of the Seventh International Parallel Processing Symposium, Newport Beach, CA, April, 1993.
42. F. Shahrokhi, L.A. Székely, O. Skora, and I. Vrto The book crossing number of a graph J. Graph Theory 21 4 1996 413 424
43. F. Shahrokhi, O. Skora, L.A. Székely, I. Vrto, Book embeddings and crossing number, Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'94), Lecture Notes in Computer Science, Vol. 903, Springer, Berlin, 1995, pp. 256-268.
44. O. Skora, and I. Vrto On crossing numbers of hypercubes and cube-connected cycles BIT 33 1993 232 237
45. O. Skora, and I. Vrto On VLSI layouts of the star graph and related networks, integration The VLSI J. 17 1994 83 93
46. J.T. Thorpe, and F.C. Harris A parallel stochastic optimization algorithm for finding mappings of the rectilinear minimal crossing problem Ars Combin. 43 1996 135 148
47. Y. Takefuji, and K.-C. Lee A near-optimum parallel planarization algorithm Science 245 1989 1221 1223
48. R. Tamassia, G. Di Battista, and C. Batini Automatic graph drawing and readability of diagrams IEEE Trans. Systems Man and Cybernet. 18 1988 61 79
49. R.E. Tarjan Sorting using networks of queues and stacks J. Assoc. Comput. Mach. 19 1972 341 346
50. J.D. Ullman Computational Aspects of VLSI 1984 Computer Science Press Rockville, MD
51. M. Yannakakis, Linear and book embeddings of graphs, in: Proceedings of the Aegean Workshop on Computing, Lecture Notes in Computer Science, Vol. 227, Springer, Berlin, 1986, pp. 229-240.
52. M. Yannakakis, Four pages are necessary and sufficient for planar graphs, Proceedings of the 18th Annual ACM Symposium on Theory of Computers, 1986, pp. 104-108.
53. A.Y. Zomaya Parallel and Distributed Computing Handbook 1996 McGraw-Hill New York