Document Open Access Logo

Upward Book Embeddings of Partitioned Digraphs

Authors Giordano Da Lozzo , Fabrizio Frati , Ignaz Rutter

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2026.36.pdf
  • Filesize: 1.44 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Computational geometry
  • Mathematics of computing → Graph algorithms
  • Theory of computation → Design and analysis of algorithms
Keywords
  • upward book embeddings
  • partitioned digraphs
  • SPQ-trees
  • 2-trees

Metrics

Abstract

In 1999, Heath, Pemmaraju, and Trenk [SIAM J. Comput. 28(4), 1999] extended the classic notion of book embeddings to digraphs, introducing the concept of upward book embeddings, in which the vertices must appear along the spine in a topological order and the edges are partitioned into pages, so that no two edges in the same page cross. For a partitioned digraph G = (V, ⋃^k_{i=1} E_i), that is, a digraph whose edge set is partitioned into k subsets, an upward book embedding is required to assign edges to pages as prescribed by the given partition. In a companion paper, Heath and Pemmaraju [SIAM J. Comput. 28(5), 1999] proved that the problem of testing the existence of an upward book embedding of a partitioned digraph is linear-time solvable for k = 1 and recently Akitaya, Demaine, Hesterberg, and Liu [GD, 2017] have shown the problem NP-complete for k ≥ 3. In this paper, we study upward book embeddings of partitioned digraphs and focus on the unsolved case k = 2. Our first main result is a novel characterization of the upward embeddings that support an upward book embedding in two pages. We exploit this characterization in several ways, and obtain a rich picture of the complexity landscape of the problem. First, we show that the problem remains NP-complete when k = 2, thus closing the complexity gap for the problem. Second, we show that, for an n-vertex partitioned digraph with a prescribed planar embedding, the existence of an upward book embedding that respects the given planar embedding can be tested in O(n log³ n) time. Finally, leveraging the SPQ(R)-tree decomposition of biconnected graphs into triconnected components, we present a cubic-time testing algorithm for biconnected directed partial 2-trees.

Cite As Get BibTex

Giordano Da Lozzo, Fabrizio Frati, and Ignaz Rutter. Upward Book Embeddings of Partitioned Digraphs. In 42nd International Symposium on Computational Geometry (SoCG 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 367, pp. 36:1-36:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.SoCG.2026.36

Author Details

Giordano Da Lozzo
  • ICITA Department, Roma Tre University, Italy
Fabrizio Frati
  • ICITA Department, Roma Tre University, Italy
Ignaz Rutter
  • Faculty of Computer Science and Mathematics, University of Passau, Germany

Acknowledgements

This research was initiated at the Fourth Summer Workshop on Graph Drawing (SWGD 2024). Thanks to the organizers and the participants for an inspiring atmosphere.

References

  1. Hugo A. Akitaya, Erik D. Demaine, Adam Hesterberg, and Quanquan C. Liu. Upward partitioned book embeddings. In Fabrizio Frati and Kwan-Liu Ma, editors, 25th International Symposium on Graph Drawing and Network Visualization (GD'17), volume 10692 of LNCS, pages 210-223. Springer, 2017. URL: https://doi.org/10.1007/978-3-319-73915-1_18.
  2. Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, and Fabrizio Frati. Strip planarity testing for embedded planar graphs. Algorithmica, 77(4):1022-1059, 2017. URL: https://doi.org/10.1007/S00453-016-0128-9.
  3. Patrizio Angelini, Giordano Da Lozzo, and Daniel Neuwirth. Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci., 575:71-89, 2015. URL: https://doi.org/10.1016/j.tcs.2014.11.016.
  4. Patrizio Angelini, Marco Di Bartolomeo, and Giuseppe Di Battista. Implementing a partitioned 2-page book embedding testing algorithm. In Walter Didimo and Maurizio Patrignani, editors, 20th International Symposium on Graph Drawing (GD'12), volume 7704 of LNCS, pages 79-89. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-36763-2_8.
  5. Gail H. Atneosen. One-dimensional n-leaved continua. Fund. Math., 74(1):43-45, 1972. URL: https://doi.org/10.4064/fm-74-1-43-45.
  6. Patricia Bachmann, Ignaz Rutter, and Peter Stumpf. On 3-coloring circle graphs. In Michael A. Bekos and Markus Chimani, editors, 31st International Symposium on Graph Drawing and Network Visualization, (GD'23), volume 14465 of LNCS, pages 152-160. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-49272-3_11.
  7. Patricia Bachmann, Ignaz Rutter, and Peter Stumpf. On 3-coloring circle graphs. J. Graph Algorithms Appl., 28(1):389-402, 2024. URL: https://doi.org/10.7155/jgaa.v28i1.2991.
  8. Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, and Chrysanthi N. Raftopoulou. Recognizing DAGs with page-number 2 is NP-complete. In Patrizio Angelini and Reinhard von Hanxleden, editors, 30th International Symposium on Graph Drawing and Network Visualization (GD'22), volume 13764 of LNCS, pages 361-370. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22203-0_26.
  9. Michael A. Bekos, Giordano Da Lozzo, Fabrizio Frati, Martin Gronemann, Tamara Mchedlidze, and Chrysanthi N. Raftopoulou. Recognizing DAGs with page-number 2 is NP-complete. Theor. Comput. Sci., 946:113689, 2023. URL: https://doi.org/10.1016/J.TCS.2023.113689.
  10. Frank Bernhart and Paul C Kainen. The book thickness of a graph. Journal of Combinatorial Theory, Series B, 27(3):320-331, 1979. URL: https://doi.org/10.1016/0095-8956(79)90021-2.
  11. Paola Bertolazzi, Giuseppe Di Battista, Giuseppe Liotta, and Carlo Mannino. Upward drawings of triconnected digraphs. Algorithmica, 12(6):476-497, 1994. URL: https://doi.org/10.1007/BF01188716.
  12. Paola Bertolazzi, Giuseppe Di Battista, Carlo Mannino, and Roberto Tamassia. Optimal upward planarity testing of single-source digraphs. SIAM J. Comput., 27(1):132-169, 1998. URL: https://doi.org/10.1137/S0097539794279626.
  13. Sandeep N. Bhatt, Fan R.K. Chung, F.Thomas Leighton, and Arnold L. Rosenberg. Scheduling tree-dags using FIFO queues: A control–memory trade-off. Journal of Parallel and Distributed Computing, 33(1):55-68, 1996. URL: https://doi.org/10.1006/jpdc.1996.0024.
  14. T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Bounds for orthogonal 3-D graph drawing. Journal of Graph Algorithms and Applications, 3(4):63-79, January 1999. URL: https://doi.org/10.7155/jgaa.00018.
  15. Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, and Maurizio Patrignani. Upward book embeddings of st-graphs. In Gill Barequet and Yusu Wang, editors, 35th International Symposium on Computational Geometry (SOCG'19), volume 129 of LIPIcs, pages 13:1-13:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.SoCG.2019.13.
  16. Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, and Maurizio Patrignani. Upward book embeddability of st-graphs: Complexity and algorithms. Algorithmica, 85(12):3521-3571, 2023. URL: https://doi.org/10.1007/s00453-023-01142-y.
  17. Glencora Borradaile, Philip N. Klein, Shay Mozes, Yahav Nussbaum, and Christian Wulff-Nilsen. Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time. SIAM J. Comput., 46(4):1280-1303, 2017. URL: https://doi.org/10.1137/15M1042929.
  18. Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Parameterized algorithms for upward planarity. In Xavier Goaoc and Michael Kerber, editors, 38th International Symposium on Computational Geometry (SOCG'22), volume 224 of LIPIcs, pages 26:1-26:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.SOCG.2022.26.
  19. Steven Chaplick, Emilio Di Giacomo, Fabrizio Frati, Robert Ganian, Chrysanthi N. Raftopoulou, and Kirill Simonov. Testing upward planarity of partial 2-trees. In Patrizio Angelini and Reinhard von Hanxleden, editors, 30th International Symposium on Graph Drawing and Network Visualization (GD'22), volume 13764 of LNCS, pages 175-187. Springer, 2022. URL: https://doi.org/10.1007/978-3-031-22203-0_13.
  20. Fan R. K. Chung, Frank Thomson Leighton, and Arnold L. Rosenberg. Embedding graphs in books: A layout problem with applications to VLSI design. SIAM Journal on Algebraic Discrete Methods, 8(1):33-58, 1987. URL: https://doi.org/10.1137/0608002.
  21. Giordano Da Lozzo, Fabrizio Frati, and Ignaz Rutter. Upward book embeddings of partitioned digraphs, 2026. URL: https://arxiv.org/abs/2603.17128.
  22. Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and Ioannis G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999. Google Scholar
  23. Giuseppe Di Battista and Roberto Tamassia. Algorithms for plane representations of acyclic digraphs. Theor. Comput. Sci., 61:175-198, 1988. URL: https://doi.org/10.1016/0304-3975(88)90123-5.
  24. Giuseppe Di Battista and Roberto Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956-997, 1996. URL: https://doi.org/10.1137/S0097539794280736.
  25. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, and Stephen K. Wismath. Book embeddability of series-parallel digraphs. Algorithmica, 45(4):531-547, 2006. URL: https://doi.org/10.1007/s00453-005-1185-7.
  26. Walter Didimo, Francesco Giordano, and Giuseppe Liotta. Upward spirality and upward planarity testing. SIAM J. Discret. Math., 23(4):1842-1899, 2009. URL: https://doi.org/10.1137/070696854.
  27. Reinhard Diestel. Graph Theory, 4th Edition, volume 173 of Graduate texts in mathematics. Springer, 2012. Google Scholar
  28. Vida Dujmović and David R. Wood. On linear layouts of graphs. Discret. Math. Theor. Comput. Sci., 6(2):339-358, 2004. URL: https://doi.org/10.46298/dmtcs.317.
  29. Hazel Everett, Sylvain Lazard, Giuseppe Liotta, and Stephen Wismath. Universal sets of n points for one-bend drawings of planar graphs with n vertices. Discret. Comput. Geom., 43(2):272-288, 2010. URL: https://doi.org/10.1007/s00454-009-9149-3.
  30. Fabrizio Frati, Joachim Gudmundsson, and Emo Welzl. On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci., 544:32-59, 2014. URL: https://doi.org/10.1016/J.TCS.2014.04.024.
  31. Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani, and Mateusz Rychlicki. A tight subexponential-time algorithm for two-page book embedding. In Karl Bringmann, Martin Grohe, Gabriele Puppis, and Ola Svensson, editors, 51st International Colloquium on Automata, Languages, and Programming (ICALP'24), volume 297 of LIPIcs, pages 68:1-68:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. URL: https://doi.org/10.4230/LIPIcs.ICALP.2024.68.
  32. Ashim Garg and Roberto Tamassia. On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput., 31(2):601-625, 2001. URL: https://doi.org/10.1137/S0097539794277123.
  33. F. Giordano, G. Liotta, T. Mchedlidze, A. Symvonis, and S.H. Whitesides. Computing upward topological book embeddings of upward planar digraphs. Journal of Discrete Algorithms, 30:45-69, 2015. URL: https://doi.org/10.1016/j.jda.2014.11.006.
  34. Carsten Gutwenger and Petra Mutzel. A linear time implementation of SPQR-trees. In Joe Marks, editor, 8th International Symposium on Graph Drawing (GD'00), volume 1984 of LNCS, pages 77-90. Springer, 2000. URL: https://doi.org/10.1007/3-540-44541-2_8.
  35. Lenwood S. Heath and Sriram V. Pemmaraju. Stack and queue layouts of directed acyclic graphs: Part II. SIAM J. Comput., 28(5):1588-1626, 1999. URL: https://doi.org/10.1137/S0097539795291550.
  36. Lenwood S Heath, Sriram V Pemmaraju, and Calvin J Ribbens. Sparse matrix-vector multiplication on a small linear array. University of Iowa, Department of Computer Science, 1993. Google Scholar
  37. Lenwood S. Heath, Sriram V. Pemmaraju, and Ann N. Trenk. Stack and queue layouts of directed acyclic graphs: Part I. SIAM J. Comput., 28(4):1510-1539, 1999. URL: https://doi.org/10.1137/S0097539795280287.
  38. Seok-Hee Hong and Hiroshi Nagamochi. Two-page book embedding and clustered graph planarity. Technical report, Dept. of Applied Mathematics and Physics, University of Kyoto, Japan, 2009. Google Scholar
  39. Seok-Hee Hong and Hiroshi Nagamochi. Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci., 725:79-98, 2018. URL: https://doi.org/10.1016/J.TCS.2015.12.039.
  40. G. Jacobson. Space-efficient static trees and graphs. In 30th Annual Symposium on Foundations of Computer Science (FOCS '89), pages 549-554. IEEE Computer Society, 1989. URL: https://doi.org/10.1109/SFCS.1989.63533.
  41. Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, and Kirill Simonov. Upward and orthogonal planarity are W[1]-hard parameterized by treewidth. In Michael A. Bekos and Markus Chimani, editors, 31st International Symposium on Graph Drawing and Network Visualization (GD'23), volume 14466 of LNCS, pages 203-217. Springer, 2023. URL: https://doi.org/10.1007/978-3-031-49275-4_14.
  42. Tamara Mchedlidze and Antonios Symvonis. Crossing-free acyclic Hamiltonian path completion for planar st-digraphs. In Yingfei Dong, Ding-Zhu Du, and Oscar H. Ibarra, editors, 20th International Symposium on Algorithms and Computation (ISAAC'09), volume 5878 of LNCS, pages 882-891. Springer, 2009. URL: https://doi.org/10.1007/978-3-642-10631-6_89.
  43. Tamara Mchedlidze and Antonios Symvonis. Crossing-optimal acyclic HP-completion for outerplanar st-digraphs. J. Graph Algorithms Appl., 15(3):373-415, 2011. URL: https://doi.org/10.7155/jgaa.00231.
  44. Kurt Mehlhorn. Data Structures and Algorithms: Multi-dimensional Searching and Computational Geometry, volume 3 of EATCS Monographs on Theoretical Computer Science. Springer, 1984. URL: https://doi.org/10.1007/978-3-642-69900-9.
  45. T. D. Morgan. Map folding. PhD thesis, Massachusetts Institute of Technology, 2012. Ph.D. thesis. URL: https://hdl.handle.net/1721.1/77030.
  46. J. Ian Munro and Venkatesh Raman. Succinct representation of balanced parentheses and static trees. SIAM J. Comput., 31(3):762-776, 2001. URL: https://doi.org/10.1137/S0097539799364092.
  47. T. Ollmann. On the book thicknesses of various graphs. In F. Hoffman, R.B. Levow, and R.S.D. Thomas, editors, Southeastern Conference on Combinatorics, Graph Theory and Computing, volume VIII of Congressus Numerantium, page 459, 1973. Google Scholar
  48. C. A. Persinger. Subsets of n-books in E^3. Pacific J. Math., 18:169-173, 1966. URL: http://projecteuclid.org/euclid.pjm/1102994417.
  49. Vaughan R. Pratt. Computing permutations with double-ended queues, parallel stacks and parallel queues. In 5th Symposium on Theory of Computing (STOC'73), pages 268-277. ACM, 1973. URL: https://doi.org/10.1145/800125.804058.
  50. Arnold L. Rosenberg. The diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Computers, 32(10):902-910, 1983. URL: https://doi.org/10.1109/TC.1983.1676134.
  51. Ajaykrishnan E S, Robert Ganian, Daniel Lokshtanov, and Vaishali Surianarayanan. A quasi-polynomial time algorithm for 3-coloring circle graphs. In Sepehr Assadi and Eva Rotenberg, editors, 9th Symposium on Simplicity in Algorithms (SOSA'26), pages 65-80. SIAM, 2026. URL: https://doi.org/10.1137/1.9781611978964.6.
  52. Robert Tarjan. Sorting using networks of queues and stacks. J. ACM, 19(2):341-346, April 1972. URL: https://doi.org/10.1145/321694.321704.
  53. Walter Unger. On the k-colouring of circle-graphs. In Robert Cori and Martin Wirsing, editors, 5th Annual Symposium on Theoretical Aspects of Computer Science (STACS '88), volume 294 of LNCS, pages 61-72. Springer, 1988. URL: https://doi.org/10.1007/BFb0035832.
  54. Manfred Wiegers. Recognizing outerplanar graphs in linear time. In Gottfried Tinhofer and Gunther Schmidt, editors, 13th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'87), pages 165-176. Springer, 1987. URL: https://doi.org/10.1007/3-540-17218-1_57.
  55. Avi Wigderson. The complexity of the Hamiltonian circuit problem for maximal planar graphs. Technical Report TR-298, EECS Department, Princeton University, 1982. URL: https://www.math.ias.edu/avi/node/820.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact