TY - GEN

T1 - Parameterized Algorithms for Book Embedding Problems

AU - Bhore, Sujoy

AU - Ganian, Robert

AU - Montecchiani, Fabrizio

AU - Nöllenburg, Martin

N1 - Funding Information:
Research of Fabrizio Montecchiani supported in part by MIUR under Grant 20174LF3T8 AHeAD: efficient Algorithms for HArnessing networked Data. Robert Ganian acknowledges support by the FWF (Project P 31336, “NFPC”) and is also affiliated with FI MUNI, Brno, Czech Republic. Research of Sujoy Bhore and Martin Nöllenburg is supported by the Austrian Science Fund (FWF) grant P 31119.
Publisher Copyright:
© Springer Nature Switzerland AG 2019.

PY - 2019/1/1

Y1 - 2019/1/1

N2 - A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether G admits a k-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thickness, or not fixed, called Book Thickness. Both problems are known to be NP-complete in general. We show that Fixed-Order Book Thickness and Book Thickness are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed-Order Book Thickness is fixed-parameter tractable parameterized by the pathwidth of the vertex order.

AB - A k-page book embedding of a graph G draws the vertices of G on a line and the edges on k half-planes (called pages) bounded by this line, such that no two edges on the same page cross. We study the problem of determining whether G admits a k-page book embedding both when the linear order of the vertices is fixed, called Fixed-Order Book Thickness, or not fixed, called Book Thickness. Both problems are known to be NP-complete in general. We show that Fixed-Order Book Thickness and Book Thickness are fixed-parameter tractable parameterized by the vertex cover number of the graph and that Fixed-Order Book Thickness is fixed-parameter tractable parameterized by the pathwidth of the vertex order.

UR - http://www.scopus.com/inward/record.url?scp=85076899006&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-35802-0_28

DO - 10.1007/978-3-030-35802-0_28

M3 - Conference contribution

AN - SCOPUS:85076899006

SN - 9783030358013

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 365

EP - 378

BT - Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings

A2 - Archambault, Daniel

A2 - Tóth, Csaba D.

PB - Springer

T2 - 27th International Symposium on Graph Drawing and Network Visualization, GD 2019

Y2 - 17 September 2019 through 20 September 2019

ER -