Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time (Q4801149)
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 1893263
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time |
scientific article; zbMATH DE number 1893263 |
Statements
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time (English)
0 references
Finding a maximum compatible tree for a bounded number of trees with bounded degree is solvable in polynomial time (English)
0 references
6 April 2003
0 references
0.829348623752594
0 references
0.8005837202072144
0 references
0.7998422384262085
0 references
0.7997804880142212
0 references
0.7989323735237122
0 references