Abstract
In the area of graph drawing, the One-Sided Crossing Minimization Problem (OSCM) is defined on a bipartite graph with both vertex sets aligned parallel to each other and all edges being drawn as straight lines. The task is to find a permutation of one of the node sets such that the total number of all edge-edge intersections, called crossings, is minimized. Usually, the degree of the nodes of one set is limited by some constant k, with the problem then abbreviated to OSCM-k.
In this work, we study an online variant of this problem, in which one of the node sets is already given. The other node set and the incident edges are revealed iteratively as requests and each node has to be inserted into placeholders, which we call slots. The number of slots coincides with the number of requests and their order is fixed. The goal is again to minimize the number of crossings in the final graph. Minimizing crossings in an online way is related to the more empirical field of dynamic graph drawing. Note that the slotted OSCM problem is harder to solve for an online algorithm but in the offline case it is equivalent to the version without slots.
We show that the online slotted OSCM-k is not competitive for any \(k\ge 2\) and subsequently limit the graph class to that of 2-regular graphs, for which we show a lower bound of 4/3 and an upper bound of 5 on the competitive ratio.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. 4, 235–282 (1994)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Burjons, E., Fuchs, J., Lotze, H.: The slotted online one-sided crossing minimization problem on 2-regular graphs. CoRR abs/2201.04061 (2022)
Dujmovic, V., Whitesides, S.: An efficient fixed parameter tractable algorithm for 1-sided crossing minimization. Algorithmica 40(1), 15–31 (2004)
Eades, P., Wormald, N.C.: Edge crossings in drawings of bipartite graphs. Algorithmica 11(4), 379–403 (1994)
Frishman, Y., Tal, A.: Online dynamic graph drawing. IEEE Trans. Vis. Comput. Graph. 14(4), 727–740 (2008)
Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 4(3), 312–316 (1983)
Kobayashi, Y., Tamaki, H.: A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization. Algorithmica 72(3), 778–790 (2015)
Komm, D.: An Introduction to Online Computation - Determinism, Randomization, Advice. Texts in Theoretical Computer Science. An EATCS Series, Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42749-2
Li, X.Y., Stallmann, M.F.M.: New bounds on the barycenter heuristic for bipartite graph drawing. Inf. Process. Lett. 82(6), 293–298 (2002)
Muñoz, X., Unger, W., Vrt’o, I.: One sided crossing minimization is NP-hard for sparse graphs. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 115–123. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45848-4_10
Nagamochi, H.: An improved bound on the one-sided minimum crossing number in two-layered drawings. Discret. Comput. Geom. 33(4), 569–591 (2005)
Nagamochi, H.: On the one-sided crossing minimization in a bipartite graph with large degrees. Theor. Comput. Sci. 332(1–3), 417–446 (2005)
North, S.C., Woodhull, G.: Online hierarchical graph drawing. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 232–246. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45848-4_19
Schaefer, M.: The graph crossing number and its variants: a survey. Electron. J. Combin. (2012)
Shannon, R., Quigley, A.J.: Considerations in dynamic graph drawing: a survey. Comput. Sci. Inform. (2007)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202–208 (1985)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Burjons, E., Fuchs, J., Lotze, H. (2022). The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. In: Bazgan, C., Fernau, H. (eds) Combinatorial Algorithms. IWOCA 2022. Lecture Notes in Computer Science, vol 13270. Springer, Cham. https://doi.org/10.1007/978-3-031-06678-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-06678-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06677-1
Online ISBN: 978-3-031-06678-8
eBook Packages: Computer ScienceComputer Science (R0)