Computing NodeTrix Representations of Clustered Graphs
Computational Geometry
2016-09-12 v2 Data Structures and Algorithms
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 NP-completeness results and some polynomial-time algorithms. Building on such algorithms we develop a JavaScript library for NodeTrix representations aimed at reducing the crossings between edges incident to the same matrix.
Keywords
Cite
@article{arxiv.1608.08952,
title = {Computing NodeTrix Representations of Clustered Graphs},
author = {Giordano Da Lozzo and Giuseppe Di Battista and Fabrizio Frati and Maurizio Patrignani},
journal= {arXiv preprint arXiv:1608.08952},
year = {2016}
}
Comments
Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016)