scientific article; zbMATH DE number 7561366
From MaRDI portal
Publication:5091002
DOI10.4230/LIPIcs.ISAAC.2018.12MaRDI QIDQ5091002
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1807.00030
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityNP-completenessphylogenetic treesdirected hypergraphsacyclic induced subgraphsrooted triple entailment
Cites Work
- On the complexity of testing for odd holes and induced odd paths
- Directed hypergraphs and applications
- Extension operations on sets of leaf-labelled trees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Finding an induced subdivision of a digraph
- Unnamed Item
This page was built for publication:
