On Computational Aspects of Greedy Partitioning of Graphs (Q4632201)

From MaRDI portal
Revision as of 02:26, 19 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7048098
Language Label Description Also known as
English
On Computational Aspects of Greedy Partitioning of Graphs
scientific article; zbMATH DE number 7048098

    Statements

    On Computational Aspects of Greedy Partitioning of Graphs (English)
    0 references
    0 references
    26 April 2019
    0 references
    graph partitioning
    0 references
    computational complexity
    0 references
    graph coloring
    0 references
    greedy algorithm
    0 references
    Grundy number
    0 references
    minimal graphs
    0 references

    Identifiers

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