On the Complexity of Finding a Largest Common Subtree of Bounded Degree
From MaRDI portal
Publication:2842767
DOI10.1007/978-3-642-40164-0_4zbMath1368.68217OpenAlexW172944714MaRDI QIDQ2842767
Atsuhiro Takasu, Takeyuki Tamura, Tatsuya Akutsu, Avraham A. Melkman
Publication date: 16 August 2013
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/203049
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items (1)
This page was built for publication: On the Complexity of Finding a Largest Common Subtree of Bounded Degree
