Pages that link to "Item:Q2862211"

The following pages link to Counting trees in a phylogenetic network is \#P-complete (Q2862211):

Displaying 13 items.

• Phylogenetic networks that display a tree twice (Q486637) (← links)
• A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
• Counting trees in a graph is \(\# \text{P}\)-complete (Q1332763) (← links)
• Tree-based networks: characterisations, metrics, and support trees (Q1731941) (← links)
• Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
• Non-essential arcs in phylogenetic networks (Q2136848) (← links)
• Counting phylogenetic networks with few reticulation vertices: a second approach (Q2166221) (← links)
• Display sets of normal and tree-child networks (Q2223460) (← links)
• Complexity of phylogenetic networks: Counting cubes in median graphs and related problems (Q2906543) (← links)
• Counting Phylogenetic Networks with Few Reticulation Vertices: Exact Enumeration and Corrections (Q5026978) (← links)
• A Structure Theorem for Rooted Binary Phylogenetic Networks and Its Implications for Tree-Based Networks (Q5163512) (← links)
• Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks (Q5377037) (← links)
• Counting General Phylogenetic networks (Q5863475) (← links)