On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering

DOI10.1016/j.tcs.2021.04.021zbMath1482.68178MaRDI QIDQ2034395

Jie Chen, Jianxin Wang, Yunlong Liu, Jingui Huang

Publication date: 22 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.04.021

zbMATH Keywords

parameterized algorithm; kernel lower bound; fixed-order book thickness; pathwidth of the vertex ordering

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)

68Q27: Parameterized complexity, tractability and kernelization