Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

GD
1997
Springer

107views Computer Graphics» more GD 1997»

Minimum-Area h-v Drawings of Complete Binary Trees

15 years 7 months ago

Minimum-Area h-v Drawings of Complete Binary Trees

Download www.dia.unisa.it

Pierluigi Crescenzi, Paolo Penna

Real-time Traffic

Computer Graphics | GD 1997 |

claim paper

Related Content

» On the approximability of two tree drawing conventions

» Drawing Binary Tanglegrams An Experimental Evaluation

» ETE a python Environment for Tree Exploration

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	GD
Authors	Pierluigi Crescenzi, Paolo Penna

Comments (0)