Skip to main content
Log in

NodeTrix Planarity Testing with Small Clusters

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

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\).

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  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). https://doi.org/10.7155/jgaa.00437

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.1016/0020-0190(79)90002-4

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.1109/TVCG.2010.265

    Article  Google Scholar 

  4. Bläsius, T., Rutter, I.: Disconnectivity and relative positions in simultaneous embeddings. Comput. Geom. 48(6), 459–478 (2015). https://doi.org/10.1016/j.comgeo.2015.02.002

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.7155/jgaa.00461

    Article  MathSciNet  MATH  Google Scholar 

  6. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River, NJ (1999)

    MATH  Google Scholar 

  7. Di Battista, G., Tamassia, R.: On-line planarity testing. SIAM J. Comput. 25(5), 956–997 (1996). https://doi.org/10.1137/S0097539794280736

    Article  MathSciNet  MATH  Google Scholar 

  8. Di Giacomo, E., Didimo, W., Liotta, G., Wismath, S.K.: Book embeddability of series-parallel digraphs. Algorithmica 45(4), 531–547 (2006). https://doi.org/10.1007/s00453-005-1185-7

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.1007/978-3-319-73915-1_37

  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). https://doi.org/10.1007/978-3-319-73915-1

  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). https://doi.org/10.1109/SFCS.1975.21

  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). https://doi.org/10.7155/jgaa.00160

    Article  MathSciNet  MATH  Google Scholar 

  13. Harary, F.: Graph Theory. Addison-Wesley Series in Mathematics. Addison Wesley, Boston (1969)

    Book  MATH  Google Scholar 

  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). https://doi.org/10.1109/TVCG.2007.70582

    Article  Google Scholar 

  15. Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM 16(6), 372–378 (1973). https://doi.org/10.1145/362248.362272

    Article  Google Scholar 

  16. Hopcroft, J., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2(3), 135–158 (1973). https://doi.org/10.1137/0202012

    Article  MathSciNet  MATH  Google Scholar 

  17. Moret, B.M.E.: Planar NAE3SAT is in P. SIGACT News 19(2), 51–54 (1988). https://doi.org/10.1145/49097.49099

    Article  MATH  Google Scholar 

  18. NodeTrix Representations: a proof-of-concept editor. http://www.dia.uniroma3.it/~dalozzo/projects/matrix

  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). https://doi.org/10.1145/800133.804350

  20. Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29(3), 623–641 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  21. Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298–313 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  22. Zhou, X., Nishizeki, T.: Orthogonal drawings of series-parallel graphs with minimum bends. SIAM J. Discrete Math. 22(4), 1570–1604 (2008). https://doi.org/10.1137/060667621

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alessandra Tappini.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

An extended abstract of this paper has been presented at the 25th International Symposium on Graph Drawing & Network Visualization. Work partially supported by MIUR Project “MODE” under PRIN 20157EFM5C, by Roma Tre University Azione 4 Project “GeoView”, and by grant Ru 1903/3-1 of the German Science Foundation (DFG).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Di Giacomo, E., Liotta, G., Patrignani, M. et al. NodeTrix Planarity Testing with Small Clusters. Algorithmica 81, 3464–3493 (2019). https://doi.org/10.1007/s00453-019-00585-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-019-00585-6

Keywords

Navigation