Publication | Closed Access

Computing the nearest neighbor interchange metric for unlabeled binary trees is NP-complete

EngineeringGraph TheoryData ScienceStructural Graph TheoryComputational ComplexityUnlabeled Binary TreesComputer ScienceNearest Neighbor InterchangeDiscrete MathematicsMetric Graph TheoryCombinatorial OptimizationGraph MatchingSimilarity Search