Login / Signup

Fixed-Parameter Tractable Algorithms for Testing Upward Planarity.

Patrick HealyKarol Lynch
Published in: SOFSEM (2005)
Keyphrases
  • computational problems
  • databases
  • learning algorithm
  • computational complexity
  • lower bound
  • complex networks
  • incomplete information
  • boolean functions