Abstract
In a book embedding the vertices of a graph are placed on the “spine” of a “book” and the edges are assigned to “pages” so that edges on the same page do not cross. In the Partitioned 2-page Book Embedding problem egdes are partitioned into two sets E 1 and E 2, the pages are two, the edges of E 1 are assigned to page 1, and the edges of E 2 are assigned to page 2. The problem consists of checking if an ordering of the vertices exists along the spine so that the edges of each page do not cross. Hong and Nagamochi [13] give an interesting and complex linear time algorithm for tackling Partitioned 2-page Book Embedding based on SPQR-trees. We show an efficient implementation of this algorithm and show its effectiveness by performing a number of experimental tests. Because of the relationships [13] between Partitioned 2-page Book Embedding and clustered planarity we yield as a side effect an implementation of a clustered planarity testing where the graph has exactly two clusters.
This work was partially supported by the ESF project 10-EuroGIGA-OP-003 GraDR “Graph Drawings and Representations”, by the MIUR of Italy, under project AlgoDEEP, prot. 2008TFBWL4, and by the italian inter-university computing Consortium CASPUR.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Angelini, P., Di Bartolomeo, M., Di Battista, G.: Implementing a partitioned 2-page book embedding testing algorithm. CoRR, arXiv:1209.0598v1 (2012)
Biedl, T.: Drawing planar partitions III: Two Constrained Embedding Problems. Tech. Report RRR 13-98, Rutcor Research Report (1998)
Biedl, T.C., Kaufmann, M., Mutzel, P.: Drawing Planar Partitions II: HH-Drawings. In: Hromkovič, J., Sýkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124–136. Springer, Heidelberg (1998)
Buss, J.F., Shor, P.W.: On the pagenumber of planar graphs. In: STOC 1984, pp. 98–100. ACM (1984)
Chimani, M., Gutwenger, C., Jünger, M., Klau, G., Klein, K., Mutzel, P.: Handbook of Graph Drawing and Visualization: The Open Graph Drawing Framework. CRC-Press (2012)
Cortese, P.F., Di Battista, G.: Clustered planarity. In: SoCG 2005, pp. 32–34 (2005)
Di Battista, G., Didimo, W.: Handbook of Graph Drawing and Visualization: GDToolkit. CRC-Press (2012)
Di Battista, G., Tamassia, R.: On-line maintenance of triconnected components with SPQR-trees. Algorithmica 15(4), 302–318 (1996)
Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25, 956–997 (1996)
Feng, Q.W., Cohen, R.F., Eades, P.: Planarity for Clustered Graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)
Frati, F., Fulek, R., Ruiz-Vargas, A.J.: On the Page Number of Upward Planar Directed Acyclic Graphs. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 391–402. Springer, Heidelberg (2012)
Gutwenger, C., Mutzel, P.: A Linear Time Implementation of SPQR-Trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77–90. Springer, Heidelberg (2001)
Hong, S., Nagamochi, H.: Two-page book embedding and clustered graph planarity. TR [2009-004], Dept. of Applied Mathematics and Physics, University of Kyoto, Japan (2009)
Ollmann, L.T.: On the book thicknesses of various graphs. Cong. Num, vol. VIII, p. 459 (1973)
Wood, D.R.: Degree constrained book embeddings. J. of Algorithms 45(2), 144–154 (2002)
Yannakakis, M.: Embedding planar graphs in four pages. JCSS 38(1), 36–67 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelini, P., Di Bartolomeo, M., Di Battista, G. (2013). Implementing a Partitioned 2-Page Book Embedding Testing Algorithm. In: Didimo, W., Patrignani, M. (eds) Graph Drawing. GD 2012. Lecture Notes in Computer Science, vol 7704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36763-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-36763-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36762-5
Online ISBN: 978-3-642-36763-2
eBook Packages: Computer ScienceComputer Science (R0)