Computing NodeTrix Representations of Clustered Graphs
DOI10.1007/978-3-319-50106-2_9zbMath1478.68227arXiv1608.08952MaRDI QIDQ2961508
Maurizio Patrignani, Giuseppe Di Battista, Fabrizio Frati, Giordano Da Lozzo
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
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
05C62: Graph representations (geometric and intersection representations, etc.)
Uses Software
