New characterisations of tree-based networks and proximity measures (Q2411310): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On determining if tree-based networks contain fixed trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A decomposition theorem for partially ordered sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the existence of infinitely many universal tree-based networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Phylogenetic networks with every embedded phylogenetic tree a base tree / rank | |||
Normal rank | |||
Revision as of 14:03, 14 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New characterisations of tree-based networks and proximity measures |
scientific article |
Statements
New characterisations of tree-based networks and proximity measures (English)
0 references
20 October 2017
0 references
phylogenetic network
0 references
tree-based network
0 references
antichain
0 references
path partition
0 references
Dilworth's theorem
0 references
