Heuristic Algorithms for the Maximum Colorful Subtree Problem (Q5090364)

From MaRDI portal
scientific article; zbMATH DE number 7559041
Language Label Description Also known as
English
Heuristic Algorithms for the Maximum Colorful Subtree Problem
scientific article; zbMATH DE number 7559041

    Statements

    0 references
    0 references
    0 references
    0 references
    18 July 2022
    0 references
    fragmentation trees
    0 references
    computational mass spectrometry
    0 references
    Heuristic Algorithms for the Maximum Colorful Subtree Problem (English)
    0 references

    Identifiers

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