Abstract
Given a graph \(G=(V,E)\) and a fixed linear order \(\prec \) of V, the problem fixed-order book thickness asks whether there is a page assignment \(\sigma \) such that \(\langle \prec ,\sigma \rangle \) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by \(\kappa \)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of \(2^{O(\kappa ^2)}\cdotp |V|\) improving on Bhore et al.’s bound of \(\kappa ^{O(\kappa ^2)}\cdotp |V|\). We further show that this parameterized problem does not admit a polynomial kernel unless NP \(\subseteq \) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time \((c+2)^{O(\kappa ^2)}\) \(\cdotp |V|\).
This research was supported in part by the National Natural Science Foundation of China under Grant (No. 61572190, 61972423), 111 Project (No. B18059) and Hunan Provincial Science and Technology Program (No. 2018TP1018, 2018WK4001).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discret. Math. Theoret. Comput. Sci. 6, 339–358 (2004)
Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for book embedding problems. In: Archambault, D., Tóth, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 365–378. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35802-0_28
Unger, W.: The complexity of colouring circle graphs. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 389–400. Springer, Heidelberg (1992). https://doi.org/10.1007/3-540-55210-3_199
Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discret. Math. 55(2), 161–166 (1985)
Ageev, A.A.: A triangle-free circle graph with chromatic number 5. Discret. Math. 152(1–3), 295–298 (1996)
Kostochka, A., Kratochvíl, J.: Covering and coloring polygon-circle graphs. Discret. Math. 163(1–3), 299–305 (1997)
Chung, F., Leighton, F., Rosenberg, A.: Embedding graphs in book: a layout problem with applications to VLSI design. SIAM J. Alg. Discr. Meth. 8(1), 33–58 (1987)
Gutin, G., Jones, M., Wahlström, M.: The mixed Chinese postman problem parameterized by pathwidth and treedepth. SIAM J. Discret. Math. 30(4), 2177–2205 (2016)
Cygan, M., Kratsch, S., Nederlof, J.: Fast Hamiltonicity checking via bases of perfect matchings. J. ACM 65(3), 12:1–12:46 (2018)
Belmonte, R., Lampis, M., Mitsou, V.: Parameterized (approximate) defective coloring. In: Niedermeier, R., Vallée, B. (eds.) STACS 2018, LIPICS, pp. 11:1–11:24 (2018)
Liu, Y., Chen, J., Huang, J.: Fixed-order book thickness with respect to vertex-cover number: new observations and further analysis. In: Chen, J., Feng, Q., Xu, J. (eds.) TAMC 2020. LNCS. Springer, Heidelberg (2020, to appear)
Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discret. Math. 28(1), 277–305 (2014)
Drucker, A.: New limits to classical and quantum instance compression. SIAM J. Comput. 44(5), 1443–1479 (2015)
Acknowledgements
The authors thank the anonymous referees, whose comments improved the presentations of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Liu, Y., Chen, J., Huang, J., Wang, J. (2020). On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-57602-8_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-57601-1
Online ISBN: 978-3-030-57602-8
eBook Packages: Computer ScienceComputer Science (R0)