, Volume 81, Issue 9, pp 3464–3493 | Cite as

NodeTrix Planarity Testing with Small Clusters

  • Emilio Di Giacomo
  • Giuseppe Liotta
  • Maurizio Patrignani
  • Ignaz Rutter
  • Alessandra TappiniEmail author


We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case when they can be chosen arbitrarily. We show that NodeTrix planarity testing with fixed sides can be solved in \(O(k^{3k+\frac{3}{2}} \cdot n)\) time for every flat clustered graph that can be reduced to a partial 2-tree by collapsing its clusters into single vertices. In the general case, NodeTrix planarity testing with fixed sides can be solved in O(n) time for \(k = 2\), but it is NP-complete for any \(k > 2\). NodeTrix planarity testing remains NP-complete also in the free sides model when \(k > 4\).


NodeTrix Hybrid representation Hybrid planarity Graph drawing 



  1. 1.
    Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Rutter, I.: Intersection-link representations of graphs. J. Graph Algorithms Appl. 21(4), 731–755 (2017). MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979). MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Batagelj, V., Brandenburg, F., Didimo, W., Liotta, G., Palladino, P., Patrignani, M.: Visual analysis of large graphs using (X, Y)-clustering and hybrid visualizations. IEEE Trans. Vis. Comput. Graph. 17(11), 1587–1598 (2011). CrossRefGoogle Scholar
  4. 4.
    Bläsius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6), 459–478 (2015). MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    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). MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River, NJ (1999)zbMATHGoogle Scholar
  7. 7.
    Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956–997 (1996). MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531–547 (2006). MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Di Giacomo, E., Liotta, G., Patrignani, M., Tappini, A.: NodeTrix planarity testing with small clusters. In: Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD ’17), LNCS, vol. 10692, pp. 479–491 (2018).
  10. 10.
    Di Giacomo, E., Liotta, G., Patrignani, M., Tappini, A.: Planar k-NodeTrix Graphs—a new family of beyond planar graphs. In: Frati, F., Ma, K. (eds.) Proc. 25th International Symposium on Graph Drawing and Network Visualization (GD ’17), LNCS, vol. 10692, pp. 609–611 (2018).
  11. 11.
    Even, S., Itai, A., Shamir, A.: On the complexity of time table and multi-commodity flow problems. In: Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pp. 184–193. IEEE Computer Society (1975).
  12. 12.
    Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. J. Graph Algorithms Appl. 12(1), 73–95 (2008). MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Harary, F.: Graph Theory. Addison-Wesley Series in Mathematics. Addison Wesley, Boston (1969)CrossRefzbMATHGoogle Scholar
  14. 14.
    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
  15. 15.
    Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973). CrossRefGoogle Scholar
  16. 16.
    Hopcroft, J., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135–158 (1973). MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51–54 (1988). CrossRefzbMATHGoogle Scholar
  18. 18.
    NodeTrix Representations: a proof-of-concept editor.
  19. 19.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216–226 (1978).
  20. 20.
    Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3), 623–641 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Zhou, X., Nishizeki, T.: Orthogonal drawings of series-parallel graphs with minimum bends. SIAM J. Discrete Math. 22(4), 1570–1604 (2008). MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Università degli Studi di PerugiaPerugiaItaly
  2. 2.Roma Tre UniversityRomaItaly
  3. 3.University of PassauPassauGermany

Personalised recommendations