|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| S. Masuda, K. Nakajima, T. Kashiwabara, T. Fujisawa, "Crossing Minimization in Linear Embeddings of Graphs," IEEE Transactions on Computers, vol. 39, no. 1, pp. 124-127, January, 1990. | |||
| BibTex | x | ||
| @article{ 10.1109/12.46286, author = {S. Masuda and K. Nakajima and T. Kashiwabara and T. Fujisawa}, title = {Crossing Minimization in Linear Embeddings of Graphs}, journal ={IEEE Transactions on Computers}, volume = {39}, number = {1}, issn = {0018-9340}, year = {1990}, pages = {124-127}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.46286}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Crossing Minimization in Linear Embeddings of Graphs IS - 1 SN - 0018-9340 SP124 EP127 EPD - 124-127 A1 - S. Masuda, A1 - K. Nakajima, A1 - T. Kashiwabara, A1 - T. Fujisawa, PY - 1990 KW - crossing minimisation; linear embeddings of graphs; circuit layout problems; NP-hard; circuit layout CAD; computational complexity; graph theory; minimisation. VL - 39 JA - IEEE Transactions on Computers ER - | |||
The problem of embedding a graph in the plane with the minimum number of edge crossings arises in some circuit layout problems. It has been known to be NP-hard in general. Recently, in the area of book embedding, this problem was shown to be NP-hard even when the vertices are placed on a straight line l. The authors show that the problem remains NP-hard even if, in addition to these constraints, the positions of the vertices on l are predetermined.
[1] F. Bernhart and P. C. Kainen, "The book thickness of a graph,"J. Comb. Theory, ser. B., vol. 27, pp. 320-331, 1979.
[2] K. S. Booth and G. S. Lueker, "Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms,"J. Comput. Syst. Sci., vol. 13, pp. 335-379, 1976.
[3] 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. Algebr. Discr. Meth., vol. 8, pp. 33-58, 1987.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[5] M. R. Garey and D. S. Johnson, "CROSSING NUMBER is NP-complete,"SIAM J. Alg. Disc. Meth., vol. 4, pp. 312-316, 1983.
[6] M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou, "The complexity of coloring circular-arcs and chords,"SIAM J. Alg. Disc. Meth., vol. 1, pp. 216-227, 1980.
[7] C. P. Hsu, "Minimum via topological routing,"IEEE Trans. Comput.- Aided Design, vol. CAD-2, pp. 235-246, Oct. 1983.
[8] J. Hopcroft and R. Tarjan, "Efficient planarity testing,"J. ACM, vol. 21, no. 4, pp. 549-568, 1974.
[9] D. S. Johnson, "The NP-completeness column: An ongoing guide,"J. Algorithms, vol. 3, pp. 381-395. 1982.
[10] F. T. Leighton, "New lower bound techniques for VLSI," inProc. 22nd IEEE Annu. Symp. Foundations Comput. Sci., Long Beach, CA, 1981, pp. 1-12.
[11] M. Marek-Sadowska, "An unconstraint topological via minimization,"IEEE Trans. Comput.-Aided Design, vol. CAD-3, pp. 184-190, July 1984.
[12] T. A. J. Nicholson, "Permutation procedure for minimizing the number of crossings in a network,"Proc. IEE, vol. 115, pp. 21-26, 1968.
[13] F. W. Sinden, "Topology of thin film circuits,"Bell Syst. Tech. J., vol. 45, pp. 1639-1666, 1966.
[14] J. D. Ullman,Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1983.