Skip to main content
SpringerLink
Log in
Book cover

Beyond Planar Graphs pp 211–235Cite as

Beyond Clustered Planar Graphs

  • Chapter
  • First Online:

Abstract

Many real-world networks exhibit an inherent clustering structure, which may arise from the presence of communities inside the network or from semantic affinities among nodes. Constructing effective visualizations for such networks is a crucial task that poses several practical and theoretical challenges. The standard theoretical model for readable representations of clustered graphs is the one, of c-planarity, introduced in the 90s and still a central research topic in graph drawing. The goal of this model is to realize drawings avoiding unnecessary crossings involving edges or clusters. This chapter reviews alternative models that have been proposed to enlarge the set of clustered graphs allowing for a representation that still conveys the clustering and relational information. First, we deal with a relaxed notion of c-planarity, in which some crossings are allowed. Then, we present two popular models for hybrid representations of clustered networks, namely NodeTrix and Intersection-Link representations, which combine different drawing paradigms for the inter-cluster and the intra-cluster relationships.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Akitaya, H.A., Fulek, R., Tóth, C.D.: Recognizing weak embeddings of graphs. ACM Trans. Algorithms, 15(4):50:1–50:27 (2019)

    Google Scholar 

  2. Angelini, P., Da Lozzo, G.: SEFE = C-Planarity? Comput. J. 59(12), 1831–1838 (2016)

    Article  MathSciNet  Google Scholar 

  3. Angelini, P., Da Lozzo, G.: Clustered planarity with pipes. Algorithmica 81(6), 2484–2526 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  4. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Relaxing the constraints of clustered planarity. Comput. Geom. 48(2), 42–75 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Angelini, P., Da Lozzo, G., Neuwirth, D.: Advancements on SEFE and partitioned book embedding problems. Theor. Comput. Sci. 575, 71–89 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  6. Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Trans. Algorithms 11(4):32:1–32:42 (2015)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F.: Strip planarity testing for embedded planar graphs. Algorithmica 77(4), 1022–1059 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  9. Angelini, P., Eades, P., Hong, S.-H., Klein, K., Kobourov, S.G., Liotta, G., Navarra, A., Tappini, A.: Turning cliques into paths to achieve planarity. In: Biedl, T.C., Kerren, A. (eds.) 26th International Symposium on Graph Drawing and Network Visualization, vol. 11282 of LNCS, pp. 67–74. Springer (2018)

    Google Scholar 

  10. Batagelj, V., Brandenburg, F.-J., 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)

    Article  Google Scholar 

  11. Besa, J.J., Da Lozzo, G., Goodrich, M.T.: Computing k-modal embeddings of planar digraphs. In: Bender, M.A., Svensson, O., Herman, G. (eds.) 27th Annual European Symposium on Algorithms, vol. 144 of LIPIcs, pp. 19:1–19:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)

    Google Scholar 

  12. Bläsius, T., Rutter, I.: A new perspective on clustered planarity as a combinatorial embedding problem. Theor. Comput. Sci. 609, 306–315 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  13. Braß, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. 36(2), 117–130 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Breu, H.: Algorithmic Aspects of Constrained Unit Disk Graphs. PhD thesis, The University of British Columbia, Canada (1996)

    Google Scholar 

  15. Brückner, G., Rutter, I.: Partial and constrained level planarity. In: Klein, P.N. (ed.) Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2000–2011. SIAM (2017)

    Google Scholar 

  16. Chaplick, S., Guspiel, G., Gutowski, G., Krawczyk, T., Liotta, G.: The partial visibility representation extension problem. Algorithmica 80(8), 2286–2323 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  17. Chimani, M., Klein, K.: Shrinking the search space for clustered planarity. In: Didimo, W., Patrignani, M. (eds.) 20th International Symposium on Graph Drawing, vol. 7704 of LNCS, pp. 90–101. Springer (2012)

    Google Scholar 

  18. Chimani, M., Gutwenger, C., Jansen, M., Klein, K., Mutzel, P.: Computing maximum c-planar subgraphs. In: Tollis, I.G., Patrignani, M. (ed.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 114–120. Springer (2008)

    Google Scholar 

  19. Chimani, M., Di Battista, G., Frati, F., Klein, K.: Advances on testing c-planarity of embedded flat clustered graphs. Int. J. Found. Comput. Sci. 30(2), 197–230 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  20. Cornelsen, S., Wagner, D.: Completely connected clustered graphs. J. Discrete Algorithms 4(2), 313–323 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Cortese, P.F., Patrignani, M.: Clustered planarity = flat clustered planarity. In: Biedl, T.C., Kerren, A. (eds.) 26th International Symposium on Graph Drawing and Network Visualization, vol. 11282 of LNCS, pp. 23–38. Springer (2018)

    Google Scholar 

  22. Cortese, P.F., Di Battista, G., Frati, F., Patrignani, M., Pizzonia, M.: C-planarity of c-connected clustered graphs. J. Graph Alg. Appl. 12(2), 225–262 (2008)

    MathSciNet  MATH  Google Scholar 

  23. Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: On embedding a cycle in a plane graph. Discrete Math. 309(7), 1856–1869 (2009)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  25. Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: Subexponential-time and FPT algorithms for embedded flat clustered planarity. In: Brandstädt, A., Köhler, E., Meer, K. (eds.) 44th International Workshop on Graph-Theoretic Concepts in Computer Science, vol. 11159 of LNCS, pp. 111–124. Springer (2018)

    Google Scholar 

  26. Da Lozzo, G., Eppstein, D., Goodrich, M.T., Gupta, S.: C-planarity testing of embedded clustered graphs with bounded dual carving-width. In: Jansen, B.M.P., Telle, J.A. (eds.) 14th International Symposium on Parameterized and Exact Computation, vol. 148 of LIPIcs, pp. 9:1–9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)

    Google Scholar 

  27. Dahlhaus, E.: A linear time algorithm to recognize clustered graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) Third Latin American Symposium on Theoretical Informatics, vol. 1380 of LNCS, pp. 239–248. Springer (1998)

    Google Scholar 

  28. Di Battista, G., Frati, F.: Efficient c-planarity testing for embedded flat clustered graphs with small faces. J. Graph Alg. Appl. 13(3), 349–378 (2009)

    MathSciNet  MATH  Google Scholar 

  29. Erten, C., Kobourov, S.G.: Simultaneous embedding of planar graphs with few bends. J. Graph Algorithms Appl. 9(3), 347–364 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  30. Feng, Q.-W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) First Annual International Conference on Computing and Combinatorics, vol. 959 of LNCS, pp. 21–30. Springer (1995)

    Google Scholar 

  31. Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) Third Annual European Symposium on Algorithms, vol. 979 of LNCS, pp. 213–226. Springer (1995)

    Google Scholar 

  32. Feng, Q.-W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) Algorithms - ESA ’95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings, vol. 979 of LNCS, pp. 213–226. Springer (1995)

    Google Scholar 

  33. Fulek, R.: Bounded embeddings of graphs in the plane. In: Mäkinen, V., Puglisi, S.J., Salmela, L. (eds.) 27th International Workshop on Combinatorial Algorithms, vol. 9843 of LNCS, pp. 31–42. Springer (2016)

    Google Scholar 

  34. Fulek, R.: C-planarity of embedded cyclic c-graphs. Comput. Geom. 66, 1–13 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  35. Fulek, R.: Embedding graphs into embedded graphs. In: Okamoto, Y., Tokuyama, T. (eds.) 28th International Symposium on Algorithms and Computation, vol. 92 of LIPIcs, pp. 34:1–34:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)

    Google Scholar 

  36. Fulek, R., Kyncl, J.: Hanani-Tutte for approximating maps of graphs. In: Speckmann, B., Tóth, C.D. (eds.) 34th International Symposium on Computational Geometry, vol. 99 of LIPIcs, pp. 39:1–39:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)

    Google Scholar 

  37. Fulek, R., Tóth, C.D.: Atomic embeddability, clustered planarity, and thickenability. In: Chawla, S. (ed.) 2020 ACM-SIAM Symposium on Discrete Algorithms, pp. 2876–2895. SIAM (2020)

    Google Scholar 

  38. Fulek, R., Kyncl, J., Malinovic, I., Pálvölgyi, D.: Efficient c-planarity testing algebraically. CoRR, abs/1305.4519 (2013)

    Google Scholar 

  39. Garey, M.R., Johnson, D.S.: The Rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826–834 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  40. Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4(3), 312–316 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  41. Giacomo, E.D., Liotta, G., Patrignani, M., Rutter, I., Tappini, A.: NodeTrix planarity testing with small clusters. Algorithmica 81(9), 3464–3493 (2019)

    Google Scholar 

  42. Goodrich, M.T., Lueker, G.S., Sun, J.Z.: C-planarity of extrovert clustered graphs. In: Healy, P., Nikolov, N.S. (eds.) 13th International Symposium on Graph Drawing, vol. 3843 of LNCS, pp. 211–222. Springer (2005)

    Google Scholar 

  43. Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs. In: Kobourov, S.G., Goodrich, M.T. (eds.) 10th International Symposium on Graph Drawing, vol. 2528 of LNCS, pp. 220–235. Springer (2002)

    Google Scholar 

  44. Gutwenger, C., Klein, K., Mutzel, P.: Planarity testing and optimal edge insertion with embedding constraints. J. Graph Algorithms Appl. 12(1), 73–95 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  45. Gutwenger, C., Mutzel, P., Schaefer, M.: Practical experience with hanani-tutte for testing c-planarity. In: McGeoch, C.C., Meyer, U. (eds.) Sixteenth Workshop on Algorithm Engineering and Experiments, pp. 86–97. SIAM (2014)

    Google Scholar 

  46. Henry, N., Fekete, J.-D., McGuffin, M.J.: NodeTrix: a hybrid visualization of social networks. IEEE Trans. Vis. Comput. Graph. 13(6), 1302–1309 (2007)

    Article  Google Scholar 

  47. Henry, N., Bezerianos, A., Fekete, J.-D.: Improving the readability of clustered social networks using node duplication. IEEE Trans. Vis. Comput. Graph. 14(6), 1317–1324 (2008)

    Article  Google Scholar 

  48. Hong, S.-H., Nagamochi, H.: Simpler algorithms for testing two-page book embedding of partitioned graphs. Theor. Comput. Sci. 725, 79–98 (2018)

    Article  MathSciNet  MATH  Google Scholar 

  49. Jelínek, V., Jelínková, E., Kratochvíl, J., Lidický, B.: Clustered planarity: Embedded clustered graphs with two-component clusters. In: Tollis, I.G., Patrignani, M. (eds.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 121–132. Springer (2008)

    Google Scholar 

  50. Jelínek, V., Suchý, O., Tesar, M., Vyskocil, T.: Clustered planarity: clusters with few outgoing edges. In: Tollis, I.G., Patrignani, M. (eds.) 16th International Symposium on Graph Drawing, vol. 5417 of LNCS, pp. 102–113. Springer (2008)

    Google Scholar 

  51. Jelínek, V., Kratochvíl, J., Rutter, I.: A Kuratowski-type theorem for planarity of partially embedded graphs. Comput. Geom. 46(4), 466–492 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  52. Jelínková, E., Kára, J., Kratochvíl, J., Pergel, M., Suchý, O., Vyskocil, T.: Clustered planarity: Small clusters in cycles and Eulerian graphs. J. Graph Algorithms Appls 13(3), 379–422 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  53. Kammer, F.: Simultaneous embedding with two bends per edge in polynomial area. In: Arge, L., Freivalds, R. (eds.) 10th Scandinavian Workshop on Algorithm Theory, vol. 4059 of LNCS, pp. 255–267. Springer (2006)

    Google Scholar 

  54. Kindermann, P., Klemz, B., Rutter, I., Schnider, P., Schulz, A.: The partition spanning forest problem. CoRR, abs/1809.02710 (2018)

    Google Scholar 

  55. Lengauer, T.: Hierarchical planarity testing algorithms. J. ACM 36(3), 474–509 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  56. Liotta, G., Rutter, I., Tappini, A.: Graph planarity testing with hierarchical embedding constraints. CoRR, abs/1904.12596 (2019)

    Google Scholar 

  57. Liotta, G., Rutter, I., Tappini, A.: Simultaneous FPQ-ordering and hybrid planarity testing. In: Chatzigeorgiou, A., Dondi, R., Herodotou, H., Kapoutsis, C.A., Manolopoulos, Y., Papadopoulos, G.A., Sikora, F. (eds.) 46th International Conference on Current Trends in Theory and Practice of Informatics, vol. 12011 of LNCS, pp. 617–626. Springer (2020)

    Google Scholar 

  58. Mchedlidze, T., Nöllenburg, M., Rutter, I.: Extending convex partial drawings of graphs. Algorithmica 76(1), 47–67 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  59. Purchase, H.C.: Which aesthetic has the greatest effect on human understanding? In: Battista, G.D. (ed.) 5th International Symposium on Graph Drawing, vol. 1353 of LNCS, pp. 248–261. Springer (1997)

    Google Scholar 

  60. Schaefer, M.: Toward a theory of planarity: Hanani-tutte and planarity variants. J. Graph Algorithms Appl. 17(4), 367–440 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  61. Unger, W.: On the k-colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) 5th Annual Symposium on Theoretical Aspects of Computer Science, vol. 294 of LNCS, pp. 61–72. Springer (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. John Cabot University, Rome, Italy

    Patrizio Angelini

  2. Roma Tre University, Rome, Italy

    Giordano Da Lozzo

Authors
  1. Patrizio Angelini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giordano Da Lozzo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Giordano Da Lozzo .

Editor information

Editors and Affiliations

  1. School of Computer Science, University of Sydney, Sydney, NSW, Australia

    Seok-Hee Hong

  2. School of Science and Technology, Kwansei Gakuin University, Sanda, Hyogo, Japan

    Takeshi Tokuyama

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Angelini, P., Da Lozzo, G. (2020). Beyond Clustered Planar Graphs. In: Hong, SH., Tokuyama, T. (eds) Beyond Planar Graphs. Springer, Singapore. https://doi.org/10.1007/978-981-15-6533-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-6533-5_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-6532-8

  • Online ISBN: 978-981-15-6533-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation