Computing NodeTrix representations of clustered graphs

DOI10.1007/978-3-319-50106-2_9MaRDI QIDQ6829089zbMATH OpenFDO

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

Publication date 21 February 2017

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

This page was built for publication: Computing NodeTrix representations of clustered graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6829089)