NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and intercluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms.

Da Lozzo, G., Di Battista, G., Frati, F., & Patrignani, M. (2016). Computing NodeTrix representations of clustered graphs. In Graph Drawing and Network Visualization 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (pp.107-120). Springer Verlag [10.1007/978-3-319-50106-2_9].

Computing NodeTrix representations of clustered graphs

DA LOZZO, GIORDANO;DI BATTISTA, Giuseppe;FRATI, FABRIZIO;PATRIGNANI, Maurizio
2016

Abstract

NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and intercluster edges as curves connecting the matrix boundaries. We study the complexity of constructing NodeTrix representations focusing on planarity testing problems, and we show several NP-completeness results and some polynomial-time algorithms.
9783319501055
Da Lozzo, G., Di Battista, G., Frati, F., & Patrignani, M. (2016). Computing NodeTrix representations of clustered graphs. In Graph Drawing and Network Visualization 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers (pp.107-120). Springer Verlag [10.1007/978-3-319-50106-2_9].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11590/316402
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 3
social impact