Using semi-definite programming to enhance supertree resolvability

Keyphrases

• Triplet 100%
• Supertree 100%
• Semidefinite Programming 100%
• Supertree Methods 100%
• Resolvability 100%
• Decision Problems 66%
• Heuristic Approach 66%
• Optimization Problem 33%
• Rooted Triplet 33%
• Inconsistency 33%
• Polynomial-time Algorithm 33%
• Quartet Trees 33%
• Large Set 33%
• Min-cut 33%
• NP-complete 33%
• NP-hard 33%
• Tree of Life 33%
• Divide-and-conquer 33%
• Reconstruction Method 33%
• Large Trees 33%
• Small Trees 33%
• Accurate Reconstruction 33%

Computer Science

• Decision Problem 100%
• Semidefinite Programming 100%
• Optimization Problem 50%
• Polynomial Time Algorithm 50%
• Experimental Evidence 50%

Mathematics

• Heuristic Approach 100%
• Polynomial Time 50%
• Min-Cut 50%
• Divide and Conquer 50%
• Quartet Tree 50%