Login / Signup
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin
Maike Buchin
Jaroslaw Byrka
Martin Nöllenburg
Yoshio Okamoto
Rodrigo I. Silveira
Alexander Wolff
Published in:
CoRR (2008)
Keyphrases
</>
fixed parameter tractable
np hard
approximation algorithms
computational complexity
np complete
description logics
closed form