Login / Signup

Drawing (Complete) Binary Tanglegrams - Hardness, Approximation, Fixed-Parameter Tractability.

Kevin BuchinMaike BuchinJaroslaw ByrkaMartin NöllenburgYoshio OkamotoRodrigo I. SilveiraAlexander Wolff
Published in: Algorithmica (2012)
Keyphrases
  • np complete
  • fixed parameter tractable
  • np hard
  • approximation algorithms
  • phase transition
  • special case
  • knowledge base
  • optimal solution
  • closed form