On the Complexity of Finding a Largest Common Subtree of Bounded Degree
type: Item
instance of: scholarly article
title: On the Complexity of Finding a Largest Common Subtree of Bounded Degree
zbMATH Open document ID: 1368.68217
DOI: 10.1007/978-3-642-40164-0_4
author: Tatsuya Akutsu
author: Avraham A. Melkman
author: Atsuhiro Takasu
published in: Fundamentals of Computation Theory
publication date: 2013-08-16T00:00:00Z
full work available at URL: http://hdl.handle.net/2433/203049
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6199045
zbMATH Keywords: tree edit distance
zbMATH Keywords: unordered trees
zbMATH Keywords: dynamic programming
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
OpenAlex ID: W172944714
description: scientific article; zbMATH DE number 6199045