TY - GEN
T1 - Parameterized Algorithms for Queue Layouts
AU - Bhore, Sujoy
AU - Ganian, Robert
AU - Montecchiani, Fabrizio
AU - Nöllenburg, Martin
N1 - Funding Information:
Research of FM partially supported by Dip. Ingegneria Univ. Perugia, RICBA19FM: “Modelli, algoritmi e sistemi per la visualizzazione di grafi e reti”. RG acknowledges support from the Austrian Science Fund (FWF) grant P 31336, SB and MN acknowledge support from FWF grant P 31119.
Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - An h-queue layout of a graph G consists of a linear order of its vertices and a partition of its edges into h queues, such that no two independent edges of the same queue nest. The minimum h such that G admits an h-queue layout is the queue number of G. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts. As our first result, we show that deciding whether a graph G has queue number 1 and computing a corresponding layout is fixed-parameter tractable when parameterized by the treedepth of G. Our second result then uses a more restrictive parameter, the vertex cover number, to solve the problem for arbitrary h.
AB - An h-queue layout of a graph G consists of a linear order of its vertices and a partition of its edges into h queues, such that no two independent edges of the same queue nest. The minimum h such that G admits an h-queue layout is the queue number of G. We present two fixed-parameter tractable algorithms that exploit structural properties of graphs to compute optimal queue layouts. As our first result, we show that deciding whether a graph G has queue number 1 and computing a corresponding layout is fixed-parameter tractable when parameterized by the treedepth of G. Our second result then uses a more restrictive parameter, the vertex cover number, to solve the problem for arbitrary h.
KW - Kernelization
KW - Parameterized complexity
KW - Queue number
KW - Treedepth
KW - Vertex cover number
UR - http://www.scopus.com/inward/record.url?scp=85102733546&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-68766-3_4
DO - 10.1007/978-3-030-68766-3_4
M3 - Conference contribution
AN - SCOPUS:85102733546
SN - 9783030687656
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 40
EP - 54
BT - Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Revised Selected Papers
A2 - Auber, David
A2 - Valtr, Pavel
PB - Springer Science and Business Media Deutschland GmbH
T2 - 28th International Symposium on Graph Drawing and Network Visualization, GD 2020
Y2 - 16 September 2020 through 18 September 2020
ER -