Computing NodeTrix Representations of Clustered Graphs

Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Patrignani, Maurizio (2016) Computing NodeTrix Representations of Clustered Graphs. In: Graph Drawing and Network Visualization. GD 2016, September, 19. - 21., 2016 , pp. 107-120(Official URL: http://dx.doi.org/10.1007/978-3-319-50106-2_9).

Full text not available from this repository.

Abstract

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

Item Type: Conference Paper
Classifications: G Algorithms and Complexity > G.350 Clusters
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1536

Actions (login required)

View Item View Item