The complexity of inferring a minimally resolved phylogenetic supertree

Keyphrases

• Internal Nodes 100%
• Phylogenetic Supertree 100%
• Separator 50%
• New Zealand 50%
• NP-hard 50%
• Cardinality 50%
• Consistent Set 50%
• Linear Time 50%
• Phylogenetic Analysis 50%
• Polynomial Time 50%
• Positive Integer 50%
• Supertree 50%
• Rooted Triplet 50%
• Recursive Algorithm 50%
• Graph Coloring 50%
• Tree-based Methods 50%
• Label Set 50%
• Tree Theory 50%
• Caterpillar 50%
• Supertree Methods 50%
• Canterbury 50%
• Optimal Graph 50%
• Christchurch 50%
• Inapproximability Results 50%
• Exponential-time Algorithms 50%

Mathematics

• Worst Case 100%
• Positive Integer 100%
• Exponential Time 100%
• Graph Coloring 100%
• Cardinality 100%
• Polynomial Time 100%
• Linear Time 100%
• Recursive Algorithm 100%

Computer Science

• Graph Coloring 100%
• Phylogenetic Analysis 100%
• Cardinality 100%
• Polynomial Time 100%
• Positive Integer 100%