Computational aspects of greedy partitioning of graphs (Q1702844)

From MaRDI portal
Revision as of 23:17, 20 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59610242, #quickstatements; #temporary_batch_1710972793655)
scientific article
Language Label Description Also known as
English
Computational aspects of greedy partitioning of graphs
scientific article

    Statements

    title
    Computational aspects of greedy partitioning of graphs (English)
    0 references
    author
    Piotr Borowiecki
    0 references
    publication date
    1 March 2018
    0 references
    zbMATH Keywords
    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

    Mathematics Subject Classification ID
    68Q25
    0 references
    05C15
    0 references
    05C70
    0 references
    05C85
    0 references
    68Q17
    0 references
    zbMATH DE Number
    6845587
    0 references
    OpenAlex ID
    W2767308712
    0 references
    Wikidata QID
    Q59610242
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1702844&oldid=33094829"
    Powered by MediaWiki