Geodesic
Computing NodeTrix Representations of Clustered Graphs
Journal of Graph Algorithms and Applications, Tome 22 (2018) no. 2, pp. 139-176.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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 $\mathbb{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.
DOI : 10.7155/jgaa.00461
Keywords: NodeTrix, Clustered graphs, Hybrid representations, Planarity 
@article{JGAA_2018_22_2_a0,
     author = {Giordano Da Lozzo and Giuseppe Di Battista and Fabrizio Frati and Maurizio Patrignani},
     title = {Computing {NodeTrix} {Representations} of {Clustered} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {139--176},
     publisher = {mathdoc},
     volume = {22},
     number = {2},
     year = {2018},
     doi = {10.7155/jgaa.00461},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00461/}
}
TY  - JOUR
AU  - Giordano Da Lozzo
AU  - Giuseppe Di Battista
AU  - Fabrizio Frati
AU  - Maurizio Patrignani
TI  - Computing NodeTrix Representations of Clustered Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2018
SP  - 139
EP  - 176
VL  - 22
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00461/
DO  - 10.7155/jgaa.00461
LA  - en
ID  - JGAA_2018_22_2_a0
ER  - 
%0 Journal Article
%A Giordano Da Lozzo
%A Giuseppe Di Battista
%A Fabrizio Frati
%A Maurizio Patrignani
%T Computing NodeTrix Representations of Clustered Graphs
%J Journal of Graph Algorithms and Applications
%D 2018
%P 139-176
%V 22
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00461/
%R 10.7155/jgaa.00461
%G en
%F JGAA_2018_22_2_a0
Giordano Da Lozzo; Giuseppe Di Battista; Fabrizio Frati; Maurizio Patrignani. Computing NodeTrix Representations of Clustered Graphs. Journal of Graph Algorithms and Applications, Tome 22 (2018) no. 2, pp. 139-176. doi : 10.7155/jgaa.00461. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00461/

Cité par Sources :