Skip to main content
SpringerLink
Log in

Parameterized Algorithms for Queue Layouts

  • Conference paper
  • First Online:
Graph Drawing and Network Visualization (GD 2020)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12590))

Included in the following conference series:

Abstract

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.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bannister, M.J., Devanny, W.E., Dujmović, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81(4), 1561–1583 (2018). https://doi.org/10.1007/s00453-018-0487-5

    Article  MathSciNet  MATH  Google Scholar 

  2. Bekos, M.A., et al.: Planar graphs of bounded degree have bounded queue number. SIAM J. Comput. 48(5), 1487–1502 (2019). https://doi.org/10.1137/19M125340X

    Article  MathSciNet  MATH  Google Scholar 

  3. Bhatt, S.N., Chung, F.R.K., Leighton, F.T., Rosenberg, A.L.: Scheduling tree-dags using FIFO queues: A control-memory trade-off. J. Parallel Distrib. Comput. 33(1), 55–68 (1996). https://doi.org/10.1006/jpdc.1996.0024

    Article  Google Scholar 

  4. Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for queue layouts. CoRR abs/2008.08288 (2020)

    Google Scholar 

  5. Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M.: Parameterized algorithms for book embedding problems. J. Graph Algorithms Appl. (2020). https://doi.org/10.7155/jgaa.00526

    Article  MATH  Google Scholar 

  6. Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theor. Comput. Sci. 411(40–42), 3736–3756 (2010). https://doi.org/10.1016/j.tcs.2010.06.026

    Article  MathSciNet  MATH  Google Scholar 

  7. de Col, P., Klute, F., Nöllenburg, M.: Mixed linear layouts: complexity, heuristics, and experiments. In: Archambault, D., Tóth, C.D. (eds.) GD 2019. LNCS, vol. 11904, pp. 460–467. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35802-0_35

    Chapter  MATH  Google Scholar 

  8. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3

    Book  MATH  Google Scholar 

  9. Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. SIAM J. Comput. 42(6), 2243–2285 (2013). https://doi.org/10.1137/130908051

    Article  MathSciNet  MATH  Google Scholar 

  10. Di Giacomo, E., Liotta, G., Meijer, H.: Computing straight-line 3d grid drawings of graphs in linear volume. Comput. Geom. 32(1), 26–58 (2005). https://doi.org/10.1016/j.comgeo.2004.11.003

    Article  MathSciNet  MATH  Google Scholar 

  11. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https://doi.org/10.1007/978-1-4471-5559-1

    Book  MATH  Google Scholar 

  12. Dujmović, V.: Graph layouts via layered separators. J. Comb. Theory, Ser. B 110, 79–89 (2015). https://doi.org/10.1016/j.jctb.2014.07.005

    Article  MathSciNet  MATH  Google Scholar 

  13. Dujmović, V., Joret, G., Micek, P., Morin, P., Ueckerdt, T., Wood, D.R.: Planar graphs have bounded queue-number. In: Foundations of Computer Science (FOCS’19), pp. 862–875. IEEE (2019). https://doi.org/10.1109/FOCS.2019.00056

  14. Dujmović, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM J. Comput. 34(3), 553–579 (2005). https://doi.org/10.1137/S0097539702416141

    Article  MathSciNet  MATH  Google Scholar 

  15. Dujmović, V., Morin, P., Wood, D.R.: Layered separators in minor-closed graph classes with applications. J. Comb. Theory, Ser. B 127, 111–147 (2017). https://doi.org/10.1016/j.jctb.2017.05.006

    Article  MathSciNet  MATH  Google Scholar 

  16. Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339–358 (2004)

    MathSciNet  MATH  Google Scholar 

  17. Dujmović, V., Wood, D.R.: Stacks, queues and tracks: layouts of graph subdivisions. Discrete Math. Theor. Comput. Sci. 7(1), 155–202 (2005)

    MathSciNet  MATH  Google Scholar 

  18. Ganian, R., Ordyniak, S.: The complexity landscape of decompositional parameters for ILP. Artif. Intell. 257, 61–71 (2018). https://doi.org/10.1016/j.artint.2017.12.006

    Article  MathSciNet  MATH  Google Scholar 

  19. Ganian, R., Peitl, T., Slivovsky, F., Szeider, S.: Fixed-parameter tractability of dependency QBF with structural parameters. In: Principles of Knowledge Representation and Reasoning (KR’20) (2020, to appear)

    Google Scholar 

  20. Gutin, G.Z., Jones, M., Wahlström, M.: The mixed Chinese postman problem parameterized by pathwidth and treedepth. SIAM J. Discrete Math. 30(4), 2177–2205 (2016). https://doi.org/10.1137/15M1034337

    Article  MathSciNet  MATH  Google Scholar 

  21. Heath, L.S., Leighton, F.T., Rosenberg, A.L.: Comparing queues and stacks as mechanisms for laying out graphs. SIAM J. Discrete Math. 5(3), 398–412 (1992). https://doi.org/10.1137/0405031

    Article  MathSciNet  MATH  Google Scholar 

  22. Heath, L.S., Rosenberg, A.L.: Laying out graphs using queues. SIAM J. Comput. 21(5), 927–958 (1992). https://doi.org/10.1137/0221055

    Article  MathSciNet  MATH  Google Scholar 

  23. Nešetřil, J., Ossona de Mendez, P.: Sparsity. AC, vol. 28. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-27875-4

    Book  MATH  Google Scholar 

  24. Ollmann, T.: On the book thicknesses of various graphs. In: Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium, vol. VIII, p. 459 (1973)

    Google Scholar 

  25. Pemmaraju, S.V.: Exploring the powers of stacks and queues via graph layouts. Ph.D. thesis, Virginia Tech (1992)

    Google Scholar 

  26. Pupyrev, S.: Mixed linear layouts of planar graphs. In: Frati, F., Ma, K.-L. (eds.) GD 2017. LNCS, vol. 10692, pp. 197–209. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-73915-1_17

    Chapter  Google Scholar 

  27. Reidl, F., Rossmanith, P., Villaamil, F.S., Sikdar, S.: A faster parameterized algorithm for treedepth. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part I. LNCS, vol. 8572, pp. 931–942. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-43948-7_77

    Chapter  Google Scholar 

  28. Tarjan, R.E.: Sorting using networks of queues and stacks. J. ACM 19(2), 341–346 (1972). https://doi.org/10.1145/321694.321704

    Article  MathSciNet  MATH  Google Scholar 

  29. Wiechert, V.: On the queue-number of graphs with bounded tree-width. Electr. J. Comb. 24(1), 65 (2017). https://doi.org/10.37236/6429

    Article  MathSciNet  MATH  Google Scholar 

  30. Yannakakis, M.: Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38(1), 36–67 (1989). https://doi.org/10.1016/0022-0000(89)90032-9

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Algorithms and Complexity Group, TU Wien, Vienna, Austria

    Sujoy Bhore, Robert Ganian & Martin Nöllenburg

  2. Université libre de Bruxelles (ULB), Bruxelles, Belgium

    Sujoy Bhore

  3. Dipartimento di Ingegneria, Università degli Studi di Perugia, Perugia, Italy

    Fabrizio Montecchiani

Authors
  1. Sujoy Bhore
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert Ganian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fabrizio Montecchiani
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Martin Nöllenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabrizio Montecchiani .

Editor information

Editors and Affiliations

  1. LaBRI, University of Bordeaux, Talence, France

    David Auber

  2. Charles University, Prague, Czech Republic

    Pavel Valtr

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bhore, S., Ganian, R., Montecchiani, F., Nöllenburg, M. (2020). Parameterized Algorithms for Queue Layouts. In: Auber, D., Valtr, P. (eds) Graph Drawing and Network Visualization. GD 2020. Lecture Notes in Computer Science(), vol 12590. Springer, Cham. https://doi.org/10.1007/978-3-030-68766-3_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68766-3_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68765-6

  • Online ISBN: 978-3-030-68766-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation