Advertisement

Simultaneous FPQ-Ordering and Hybrid Planarity Testing

  • Giuseppe Liotta
  • Ignaz Rutter
  • Alessandra TappiniEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12011)

Abstract

We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planarity, and prove that this problem can be solved in quadratic time for biconnected graphs. Our solution is based on a new definition of fixedness that makes it possible to simplify and extend known techniques about Simultaneous PQ-Ordering. We apply these results to different variants of hybrid planarity testing, including a relaxation of NodeTrix Planarity with fixed sides, that allows rows and columns to be independently permuted.

References

  1. 1.
    Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. JGAA 21(4), 731–755 (2017)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bläsius, T., Rutter, I.: Simultaneous PQ-ordering with applications to constrained embedding problems. ACM Trans. Algorithms 12(2), 16:1–16:46 (2016)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. C. Syst. Sci. 13(3), 335–379 (1976)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M.: Computing NodeTrix representations of clustered graphs. J. Graph Algorithms Appl. 22(2), 139–176 (2018)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956–997 (1996)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Di Giacomo, E., Liotta, G., Patrignani, M., Rutter, I., Tappini, A.: NodeTrix planarity testing with small clusters. Algorithmica 81(9), 3464–3493 (2019)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Henry, N., Fekete, J., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302–1309 (2007)CrossRefGoogle Scholar
  8. 8.
    Liotta, G., Rutter, I., Tappini, A.: Graph planarity testing with hierarchical embedding constraints. CoRR abs/1904.12596 (2019)Google Scholar
  9. 9.
    Liotta, G., Rutter, I., Tappini, A.: Simultaneous FPQ-Ordering and hybrid planarity testing. CoRR abs/1910.10113 (2019)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Dipartimento di IngegneriaUniversità degli Studi di PerugiaPerugiaItaly
  2. 2.Department of Computer Science and MathematicsUniversity of PassauPassauGermany

Personalised recommendations