Abstract
The worst-case performances of some heuristics for the fixed linear crossing number problem (FLCNP) are analyzed. FLCNP is similar to the 2-page book crossing number problem in which the vertices of a graph are optimally placed on a horizontal “node line” in the plane, each edge is drawn as an arc in one half-plane (page), and the objective is to minimize the number of edge crossings. In FLCNP, the order of the vertices along the node line is predetermined and fixed. FLCNP belongs to the class of NP-hard optimization problems Masuda et al., 1990. In this paper we show that for each of the heuristics described, there exist classes of n-vertex, m-edge graphs which force it to obtain a number of crossings which is a function of n or m when the optimal number is a small constant. This leaves open the problem of finding a heuristic with a constant error bound for the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bernhart, F. and P.C. Kainen. (1979). “The Book Thickness of a Graph.” J. Comb. Theory B 27, 320–331.
Bhatt, S.N. and F.T. Leighton. (1984). “A Framework for Solving VLSI Graph Layout Problems.” J. Comput. & Sys. Sci. 28, 300–343.
Bilski, T. (1992). “Embedding Graphs in Books: A Survey.” IEE Proc. E 139(2), 134–138.
Chinn, P.Z., L. Chvátalová, A.K. Dewdney, and N.E. Gibbs. (1982). “The Bandwidth Problem for Graphs and Matrices–a Survey.” J. Graph Theory 6, 223–253.
Chung, F.R.K., F.T. Leighton, and A.L. Rosenberg. (1987). “Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design.” SIAM J. Alg. & Discrete Methods 8, 33–58.
Cimikowski, R. (2002). “Algorithms for the Fixed Linear Crossing Number Problem.” Discrete Applied Mathematics 122(1–3), 93–115.
Cimikowski, R. and P. Shope. (1996). “A Neural Network Algorithm for a Graph Layout Problem.” IEEE Trans. Neural Networks 7(2) 341–345.
Di Battista, G., Eades, P., Tamassia, R., and I.G. Tollis. (1994). “Algorithms for Drawing Graphs: An Annotated Bibliography.” Comput. Geom.: Theory & Appl. 4, 235–282.
Di Battista, G., Eades, P., Tamassia, R., and I.G. Tollis. (1999). Graph Drawing. NJ: Prentice-Hall, Upper Saddle River.
Gilbert, R.S. and W.K. Kleinöder. (1985). “CNMgraf—Graphic Presentation Services for Network Management.” In Proc. 9th. Symp. on Data Comm. Vancouver, B.C., Canada, pp. 199–206.
Jünger, M. and P. Mutzel. (1997). “2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms.” J. Graph Algorithms & Appl. 1(1) 1–25.
Kainen, P.C. (1990). “The Book Thickness of a Graph, II.” Congressus Numerantium 71, 127–132.
Malitz, S.M. (1994). “On the Page Number of Graphs.” J. Algorithms 17(1), 71–84.
Masuda, S., K. Nakajima, T. Kashiwabara, and T. Fujisawa. (1990) “Crossing Minimization in Linear Embeddings of Graphs.” IEEE Trans. Comput. 39(1), 124–127.
Nicholson, T.A.J. (1968). “Permutation Procedure for Minimising the Number of Crossings in a Network.” Proc. IEE 115(1), 21–26.
Raghavan, R. and S. Sahni. (1983). “Single-Row Routing.” IEEE Trans. Comput. C-32(3), 209–220
Rosenberg, A.L. (1983). “The DIOGENES Approach to Testable Fault-Tolerant Arrays of Processors.” IEEE Trans. Comput. C-32(10), 902–910.
Shahrokhi, F., O. Sýkora, L.A. Székely, and I. Vrto. (1997) “Crossing Numbers: Bounds and Applications.” In I. Barany, K. Boroczky, (eds.), Intuitive Geometry Bolyai Soc. Math. Studies 6, Akademia Kiado, Budapest,” pp. 179–206.
Shahrokhi, F., L.A. Székely, O. Sýkora, and I. Vrto. (1996). “The Book Crossing Number of a Graph.” J. Graph Theory 21(4), 413–424.
Shahrokhi, F., O. Sýkora, L.A. Székely, and I. Vrto. (1995) “Book Embeddings and Crossing Number.” In Proc. 20th. Int. Workshop on Graph-Theoretic Concepts in Comput. Sci WG’94, Lecture Notes in Comput. Sci., 903, Berlin Springer-Verlag, pp. 256–268.
Tamassia, R., G. Di Battista, and C. Batini. (1988) “Automatic Graph Drawing and Readability of Diagrams.” IEEE Trans. Sys., Man, and Cyber. 18, 61–79.
Tarjan, R.E. (1972) “Sorting Using Networks of Queues and Stacks.” J. Assoc. Comput. Mach. 19, 341–346.
Ullman, J.D. (1984). Computational aspects of VLSI. Computer Science Press, Rockville, MD.
Yannakakis, M. (1986). “Linear and Book Embeddings of Graphs.” In Proc. Aegean Workshop on Computing, LNCS 227, Berlin Springer Verlag,” pp. 229–240.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cimikowski, R. An analysis of some linear graph layout heuristics. J Heuristics 12, 143–153 (2006). https://doi.org/10.1007/s10732-006-4294-9
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-006-4294-9