Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time (Q4801149)
From MaRDI portal
scientific article; zbMATH DE number 1893263
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
6 April 2003
0 references
