Title of article :
On the approximability of two tree drawing conventions
Author/Authors :
Paolo Penna، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2002
Pages :
6
From page :
237
To page :
242
Keywords :
Tree drawing , computational complexity , approximation algorithms , Computational geometry
Journal title :
Information Processing Letters
Serial Year :
2002
Journal title :
Information Processing Letters
Record number :
129519
Link To Document :
بازگشت