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.
|Titolo:||Computing NodeTrix representations of clustered graphs|
|Data di pubblicazione:||2016|
|Citazione:||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.|
|Appare nelle tipologie:||4.1 Contributo in Atti di convegno|