Deciding the closure of inconsistent rooted triples is NP-complete (Q5091002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deciding the closure of inconsistent rooted triples is NP-complete |
scientific article; zbMATH DE number 7561366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding the closure of inconsistent rooted triples is NP-complete |
scientific article; zbMATH DE number 7561366 |
Statements
21 July 2022
0 references
phylogenetic trees
0 references
rooted triple entailment
0 references
NP-completeness
0 references
directed hypergraphs
0 references
acyclic induced subgraphs
0 references
computational complexity
0 references
0 references
0.8283230066299438
0 references
0.7963303327560425
0 references
0.7947179079055786
0 references
0.7938349843025208
0 references
0.7935441136360168
0 references
