The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees

DOI10.1016/S0166-218X(99)00160-2zbMath0948.05022MaRDI QIDQ1962070

Nicholas C. Wormald, Meei Pyng Ng, Mike A. Steel

Publication date: 10 April 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

subtreeleaf-labelled tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Problems related to evolution (92D15)

Related Items (3)

Solving infinite-domain CSPs using the patchwork property ⋮ THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION ⋮ Determining the consistency of partial tree descriptions

Cites Work

• Unnamed Item
• The complexity of reconstructing trees from qualitative characters and subtrees
• An efficient algorithm for supertrees
• Reconstruction of rooted trees from subtrees
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions

This page was built for publication: The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees