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

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references