Login / Signup

The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs.

Hans L. BodlaenderMichael R. FellowsMichael T. HallettTodd WarehamTandy J. Warnow
Published in: Theor. Comput. Sci. (2000)
Keyphrases
  • np complete
  • graph matching
  • perfect phylogeny
  • np hard
  • dynamic programming
  • application domains
  • bipartite graph
  • computationally feasible