Work

Computing NodeTrix Representations of Clustered Graphs

Year: 2016

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1608.08952

Authors: Da Lozzo, Giordano, Di Battista, Giuseppe, Frati, Fabrizio, Patrignani, Maurizio

Institution: Roma Tre University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Ministero dell’Istruzione, dell’Università e della Ricerca

Awards: AMANDA: Algorithmics for MAssive and Networked DAta, G539898336

OpenAlex ID: W2953355326

Cites: 15

Cited by: 2

Related to: 20