Finding largest common embeddable subtrees

DOI10.1007/3-540-59042-0_91MaRDI QIDQ4596639zbMATH OpenOpenAlexFDO

Authors Arvind Kumar Gupta, N. 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

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05) Parallel algorithms in computer science (68W10)

Recommendations

• On finding common subtrees
• On the complexity of finding a largest common subtree of bounded degree
• On the complexity of finding a largest common subtree of bounded degree
• Finding largest subtrees and smallest supertrees
• On the approximation of largest common subtrees and largest common point sets
• scientific article; zbMATH DE number 1555958
• About the largest subtree common to several X-trees
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• scientific article; zbMATH DE number 4145922

Cited in

(6)

• Finding largest subtrees and smallest supertrees
• An algebraic view of the relation between largest common subtrees and smallest common supertrees
• Longest common extensions in trees
• About the largest subtree common to several X-trees
• Largest Weight Common Subtree Embeddings with Distance Penalties
• Finding smallest supertrees

This page was built for publication: Finding largest common embeddable subtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596639)