Publication | Closed Access

Finding a maximum compatible tree is NP-hard for sequences and trees

Tree LanguageEngineeringGraph TheoryComputational ComplexityExtremal CombinatoricsP Versus Np ProblemComputer ScienceTree AutomatonDiscrete MathematicsTime ComplexityCombinatorial OptimizationMaximum Compatible Tree