Skip to main content
Conference ProceedingsOPEN ACCESS

Computing NodeTrix representations of clustered graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2016) 9801 LNCS 107-120
DOI: 10.1007/978-3-319-50106-2_9
5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Da Lozzo, G., Di Battista, G., Frati, F., & Patrignani, M. (2016). Computing NodeTrix representations of clustered graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9801 LNCS, pp. 107–120). Springer Verlag. https://doi.org/10.1007/978-3-319-50106-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free