Solving the tree containment problem for genetically stable networks in quadratic time (Q2798232)
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: Solving the tree containment problem for genetically stable networks in quadratic time |
scientific article; zbMATH DE number 6562485
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the tree containment problem for genetically stable networks in quadratic time |
scientific article; zbMATH DE number 6562485 |
Statements
Solving the Tree Containment Problem for Genetically Stable Networks in Quadratic Time (English)
0 references
4 April 2016
0 references
0.9495440125465392
0 references
0.8841370940208435
0 references
0.8734575510025024
0 references
0.8614662289619446
0 references
0.8388155698776245
0 references
