Finding largest common embeddable subtrees
From MaRDI portal
Publication:4596639
DOI10.1007/3-540-59042-0_91zbMath1379.68106OpenAlexW1534610542MaRDI QIDQ4596639
Arvind Kumar Gupta, Naomi Nishimura
Publication date: 4 December 2017
Published in: STACS 95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-59042-0_91
Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10) Data structures (68P05)
This page was built for publication: Finding largest common embeddable subtrees