Complexity results for three-dimensional orthogonal graph drawing

From MaRDI portal
Publication:954967

DOI10.1016/j.jda.2006.06.002zbMath1152.68046OpenAlexW2060444627MaRDI QIDQ954967

Maurizio Patrignani

Publication date: 18 November 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.06.002




Related Items (3)



Cites Work


This page was built for publication: Complexity results for three-dimensional orthogonal graph drawing