Title of article :
On the approximability of two tree drawing conventions
Author/Authors :
Paolo Penna، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Keywords :
Tree drawing , computational complexity , approximation algorithms , Computational geometry
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters