Computing NodeTrix Representations of Clustered Graphs

DOI10.1007/978-3-319-50106-2_9zbMath1478.68227arXiv1608.08952OpenAlexW2515423284MaRDI QIDQ2961508

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

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science, Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.08952

zbMATH Keywords

visualization of clustered graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Algorithms and Bounds for L-Drawings of Directed Graphs, A user study on hybrid graph visualizations, \((k,p)\)-planarity: a relaxation of hybrid planarity, Synchronized Planarity with Applications to Constrained Planarity Problems, Computing NodeTrix Representations of Clustered Graphs, ChordLink: a new hybrid visualization model, Parameterized complexity of graph planarity with restricted cyclic orders, Clustered planarity = flat clustered planarity, Turning cliques into paths to achieve planarity, Parameterized complexity of graph planarity with restricted cyclic orders, Simultaneous FPQ-ordering and hybrid planarity testing, C-planarity testing of embedded clustered graphs with bounded dual carving-width, Computing k-modal embeddings of planar digraphs, 2-colored point-set embeddings of partial 2-trees, 2-colored point-set embeddings of partial 2-trees, NodeTrix planarity testing with small clusters, Beyond Clustered Planar Graphs

Uses Software

• JavaScript
• NodeTrix

Cites Work

• Unnamed Item
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Relaxing the constraints of clustered planarity
• Advancements on SEFE and partitioned book embedding problems
• The importance of being proper
• Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
• Intersection-Link Representations of Graphs
• Computing NodeTrix Representations of Clustered Graphs
• Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
• Total Ordering Problem
• Recognition of Circle Graphs
• Planarity Testing and Optimal Edge Insertion with Embedding Constraints
• C-Planarity of C-Connected Clustered Graphs