NodeTrix Planarity Testing with Small Clusters

Giacomo, Emilio Di; Liotta, Giuseppe; Patrignani, Maurizio; Tappini, Alessandra

doi:10.1007/s00453-019-00585-6

Cited by 16 publications

(19 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hybrid visualizations have also been exploited in the context of dynamic network analysis (see, e.g., [15,32,55]). We finally mention several theoretical results on hybrid visualizations that concentrate on the complexity of minimizing the number of intercluster edge crossings (see, e.g., [6,7,8,17,22,23,24,39,41]).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A User Study on Hybrid Graph Visualizations

Giacomo¹,

Didimo²,

Fabrizio³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Hybrid visualizations mix different metaphors in a single layout of a network. In particular, the popular NodeTrix model, introduced by Henry, Fekete, and McGuffin in 2007, combines node-link diagrams and matrix-based representations to support the analysis of real-world networks that are globally sparse but locally dense. That idea inspired a series of works, proposing variants or alternatives to NodeTrix. We present a user study that compares the classical node-link model and three hybrid visualization models designed to work on the same types of networks. The results of our study provide interesting indications about advantages/drawbacks of the considered models on performing classical tasks of analysis. At the same time, our experiment has some limitations and opens up to further research on the subject.

show abstract

Section: Related Workmentioning

confidence: 99%

“…1(c)). After the introduction of NodeTrix, hybrid visualizations have become an emerging topic in graph drawing and network visualization, and inspired an array of both theoretical and application results (see, e.g., [7,8,9,11,14,22,23,24,33,39,41,59]).…”

Section: Introductionmentioning

confidence: 99%

A User Study on Hybrid Graph Visualizations

Giacomo¹,

Didimo²,

Fabrizio³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the first direction, an interesting variant of the Node-Trix model is proposed in [4]; while in NodeTrix the clusters represented as an adjacency matrix are selected by the user, in [4] the set of clusters is computed by the drawing algorithm so that the resulting graph of clusters (drawn as an orthogonal layout) is planar; the user can choose the drawing style inside each cluster region, including the possibility of using a matrix-based representation. In the second direction, several papers study the so-called hybrid planarity testing problem, both in the NodeTrix model [7,9] and in a different model where clusters are intersection graphs of geometric objects [1]. This problem asks whether a given graph admits a hybrid visualization such that the edges represented as geometric links do not cross any cluster region and do not cross each other.…”

Section: Related Workmentioning

confidence: 99%

ChordLink: A New Hybrid Visualization Model

Angori

Didimo

Montecchiani

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. This double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, NodeTrix combines node-link and matrixbased representations (Henry et al., 2007). In this paper we describe ChordLink, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. The visualization is intuitive and makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the ChordLink model, present a prototype system, and illustrate case studies on real-world networks.

show abstract

“…The NodeTrix model [3] represents a first example of hybrid representation. It combines node-link diagrams with adjacency-matrix representations of the denser subgraphs [3][4][5][6]. Inspired by NodeTrix, other hybrid representation models were recently introduced [7][8][9].…”

Section: Introductionmentioning

confidence: 99%

Graph Planarity by Replacing Cliques with Paths

et al. 2020

Self Cite

View full text Add to dashboard Cite

This paper introduces and studies the following beyond-planarity problem, which we call h-Clique2Path Planarity. Let G be a simple topological graph whose vertices are partitioned into subsets of size at most h, each inducing a clique. h-Clique2Path Planarity asks whether it is possible to obtain a planar subgraph of G by removing edges from each clique so that the subgraph induced by each subset is a path. We investigate the complexity of this problem in relation to k-planarity. In particular, we prove that h-Clique2Path Planarity is NP-complete even when h=4 and G is a simple 3-plane graph, while it can be solved in linear time when G is a simple 1-plane graph, for any value of h. Our results contribute to the growing fields of hybrid planarity and of graph drawing beyond planarity.

show abstract

NodeTrix Planarity Testing with Small Clusters

Cited by 16 publications

References 20 publications

A User Study on Hybrid Graph Visualizations

A User Study on Hybrid Graph Visualizations

ChordLink: A New Hybrid Visualization Model

Graph Planarity by Replacing Cliques with Paths

Contact Info

Product

Resources

About