Complexity of phylogenetic networks: Counting cubes in median graphs and related problems (Q2906543)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6077582
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of phylogenetic networks: Counting cubes in median graphs and related problems |
scientific article; zbMATH DE number 6077582 |
Statements
5 September 2012
0 references
hypercubes counting
0 references
Complexity of phylogenetic networks: Counting cubes in median graphs and related problems (English)
0 references
0.8407965898513794
0 references
0.7450101971626282
0 references
0.7275594472885132
0 references
0.7260684967041016
0 references
0.7251410484313965
0 references
